./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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/queue.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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:34:53,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:34:53,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:34:53,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:34:53,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:34:53,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:34:53,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:34:53,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:34:53,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:34:53,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:34:53,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:34:53,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:34:53,888 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:34:53,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:34:53,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:34:53,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:34:53,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:34:53,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:34:53,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:34:53,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:34:53,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:34:53,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:34:53,890 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:34:53,890 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:34:53,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:34:53,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:34:53,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:34:53,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:34:53,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:34:53,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:34:53,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:34:53,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:34:53,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:34:53,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:34:53,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:34:53,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:34:53,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:34:53,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:34:53,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:34:53,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:34:53,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:34:53,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:34:53,892 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-03-08 21:34:54,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:34:54,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:34:54,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:34:54,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:34:54,134 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:34:54,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-03-08 21:34:55,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58fcfd5b/653db6351f7648f6b693886ee69b0826/FLAGc467bcf6c [2025-03-08 21:34:55,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:34:55,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-03-08 21:34:55,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58fcfd5b/653db6351f7648f6b693886ee69b0826/FLAGc467bcf6c [2025-03-08 21:34:55,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58fcfd5b/653db6351f7648f6b693886ee69b0826 [2025-03-08 21:34:55,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:34:55,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:34:55,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:34:55,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:34:55,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:34:55,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:34:55" (1/1) ... [2025-03-08 21:34:55,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164ad910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:55, skipping insertion in model container [2025-03-08 21:34:55,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:34:55" (1/1) ... [2025-03-08 21:34:55,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:34:56,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:34:56,212 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:34:56,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:34:56,313 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:34:56,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56 WrapperNode [2025-03-08 21:34:56,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:34:56,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:34:56,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:34:56,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:34:56,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,367 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 518 [2025-03-08 21:34:56,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:34:56,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:34:56,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:34:56,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:34:56,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:34:56,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:34:56,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:34:56,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:34:56,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (1/1) ... [2025-03-08 21:34:56,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:34:56,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:34:56,450 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-08 21:34:56,452 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-08 21:34:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-08 21:34:56,468 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-08 21:34:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-08 21:34:56,468 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-08 21:34:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:34:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:34:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:34:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:34:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:34:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:34:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:34:56,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:34:56,470 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:34:56,591 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:34:56,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:34:57,158 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:34:57,159 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:34:57,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:34:57,188 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:34:57,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:34:57 BoogieIcfgContainer [2025-03-08 21:34:57,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:34:57,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:34:57,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:34:57,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:34:57,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:34:55" (1/3) ... [2025-03-08 21:34:57,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6a681c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:34:57, skipping insertion in model container [2025-03-08 21:34:57,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:56" (2/3) ... [2025-03-08 21:34:57,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6a681c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:34:57, skipping insertion in model container [2025-03-08 21:34:57,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:34:57" (3/3) ... [2025-03-08 21:34:57,198 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-08 21:34:57,215 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:34:57,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 577 locations, 1 initial locations, 2 loop locations, and 42 error locations. [2025-03-08 21:34:57,219 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:34:57,385 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 21:34:57,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 583 places, 592 transitions, 1198 flow [2025-03-08 21:34:57,607 INFO L124 PetriNetUnfolderBase]: 16/590 cut-off events. [2025-03-08 21:34:57,609 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:34:57,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 590 events. 16/590 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 780 event pairs, 0 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 451. Up to 2 conditions per place. [2025-03-08 21:34:57,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 583 places, 592 transitions, 1198 flow [2025-03-08 21:34:57,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 570 places, 577 transitions, 1163 flow [2025-03-08 21:34:57,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:34:57,664 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;@3dad99e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:34:57,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-03-08 21:34:57,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:34:57,674 INFO L124 PetriNetUnfolderBase]: 0/78 cut-off events. [2025-03-08 21:34:57,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:34:57,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:34:57,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:34:57,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:34:57,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:34:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash 660549691, now seen corresponding path program 1 times [2025-03-08 21:34:57,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:34:57,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320132463] [2025-03-08 21:34:57,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:34:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:34:57,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 21:34:57,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 21:34:57,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:34:57,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:34:57,900 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-08 21:34:57,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:34:57,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320132463] [2025-03-08 21:34:57,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320132463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:34:57,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:34:57,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:34:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761952663] [2025-03-08 21:34:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:34:57,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:34:57,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:34:57,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:34:57,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:34:57,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 592 [2025-03-08 21:34:57,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 577 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 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-08 21:34:57,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:34:57,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 592 [2025-03-08 21:34:57,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:34:58,272 INFO L124 PetriNetUnfolderBase]: 61/1686 cut-off events. [2025-03-08 21:34:58,273 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-08 21:34:58,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1686 events. 61/1686 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 7648 event pairs, 27 based on Foata normal form. 24/1533 useless extension candidates. Maximal degree in co-relation 1595. Up to 70 conditions per place. [2025-03-08 21:34:58,282 INFO L140 encePairwiseOnDemand]: 585/592 looper letters, 15 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2025-03-08 21:34:58,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 568 transitions, 1179 flow [2025-03-08 21:34:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:34:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:34:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2025-03-08 21:34:58,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9617117117117117 [2025-03-08 21:34:58,298 INFO L175 Difference]: Start difference. First operand has 570 places, 577 transitions, 1163 flow. Second operand 3 states and 1708 transitions. [2025-03-08 21:34:58,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 568 transitions, 1179 flow [2025-03-08 21:34:58,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 568 transitions, 1174 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 21:34:58,317 INFO L231 Difference]: Finished difference. Result has 564 places, 568 transitions, 1144 flow [2025-03-08 21:34:58,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1144, PETRI_PLACES=564, PETRI_TRANSITIONS=568} [2025-03-08 21:34:58,323 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -6 predicate places. [2025-03-08 21:34:58,323 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 568 transitions, 1144 flow [2025-03-08 21:34:58,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 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-08 21:34:58,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:34:58,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:34:58,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:34:58,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:34:58,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:34:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash 549712237, now seen corresponding path program 1 times [2025-03-08 21:34:58,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:34:58,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826671447] [2025-03-08 21:34:58,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:34:58,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:34:58,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 21:34:58,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:34:58,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:34:58,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:34:58,409 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-08 21:34:58,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:34:58,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826671447] [2025-03-08 21:34:58,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826671447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:34:58,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:34:58,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:34:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204344484] [2025-03-08 21:34:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:34:58,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:34:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:34:58,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:34:58,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:34:58,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 592 [2025-03-08 21:34:58,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 568 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 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-08 21:34:58,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:34:58,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 592 [2025-03-08 21:34:58,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:34:58,742 INFO L124 PetriNetUnfolderBase]: 69/1960 cut-off events. [2025-03-08 21:34:58,742 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 21:34:58,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 1960 events. 69/1960 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 9634 event pairs, 29 based on Foata normal form. 0/1755 useless extension candidates. Maximal degree in co-relation 1968. Up to 74 conditions per place. [2025-03-08 21:34:58,759 INFO L140 encePairwiseOnDemand]: 589/592 looper letters, 15 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-03-08 21:34:58,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 567 transitions, 1176 flow [2025-03-08 21:34:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:34:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:34:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1704 transitions. [2025-03-08 21:34:58,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9594594594594594 [2025-03-08 21:34:58,763 INFO L175 Difference]: Start difference. First operand has 564 places, 568 transitions, 1144 flow. Second operand 3 states and 1704 transitions. [2025-03-08 21:34:58,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 567 transitions, 1176 flow [2025-03-08 21:34:58,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 567 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:34:58,771 INFO L231 Difference]: Finished difference. Result has 563 places, 567 transitions, 1142 flow [2025-03-08 21:34:58,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=563, PETRI_TRANSITIONS=567} [2025-03-08 21:34:58,772 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -7 predicate places. [2025-03-08 21:34:58,772 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 567 transitions, 1142 flow [2025-03-08 21:34:58,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 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-08 21:34:58,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:34:58,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:34:58,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:34:58,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:34:58,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:34:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash 58637508, now seen corresponding path program 1 times [2025-03-08 21:34:58,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:34:58,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121545946] [2025-03-08 21:34:58,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:34:58,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:34:58,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 21:34:58,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 21:34:58,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:34:58,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:34:59,314 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-08 21:34:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:34:59,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121545946] [2025-03-08 21:34:59,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121545946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:34:59,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:34:59,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:34:59,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841483297] [2025-03-08 21:34:59,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:34:59,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:34:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:34:59,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:34:59,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:00,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 592 [2025-03-08 21:35:00,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 567 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-08 21:35:00,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:00,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 592 [2025-03-08 21:35:00,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:02,171 INFO L124 PetriNetUnfolderBase]: 3671/15096 cut-off events. [2025-03-08 21:35:02,172 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-08 21:35:02,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22144 conditions, 15096 events. 3671/15096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 136636 event pairs, 3314 based on Foata normal form. 0/13635 useless extension candidates. Maximal degree in co-relation 22055. Up to 6868 conditions per place. [2025-03-08 21:35:02,269 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 138 selfloop transitions, 5 changer transitions 0/566 dead transitions. [2025-03-08 21:35:02,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 566 transitions, 1426 flow [2025-03-08 21:35:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2766 transitions. [2025-03-08 21:35:02,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787162162162162 [2025-03-08 21:35:02,284 INFO L175 Difference]: Start difference. First operand has 563 places, 567 transitions, 1142 flow. Second operand 6 states and 2766 transitions. [2025-03-08 21:35:02,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 566 transitions, 1426 flow [2025-03-08 21:35:02,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 566 transitions, 1422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:02,304 INFO L231 Difference]: Finished difference. Result has 565 places, 566 transitions, 1146 flow [2025-03-08 21:35:02,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1146, PETRI_PLACES=565, PETRI_TRANSITIONS=566} [2025-03-08 21:35:02,309 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -5 predicate places. [2025-03-08 21:35:02,309 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 566 transitions, 1146 flow [2025-03-08 21:35:02,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-08 21:35:02,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:02,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:02,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:35:02,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:02,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1420314719, now seen corresponding path program 1 times [2025-03-08 21:35:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:02,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951139256] [2025-03-08 21:35:02,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:02,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:02,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 21:35:02,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 21:35:02,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:02,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:02,921 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-08 21:35:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951139256] [2025-03-08 21:35:02,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951139256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:02,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:02,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22660896] [2025-03-08 21:35:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:02,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:02,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:02,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:03,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 592 [2025-03-08 21:35:03,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 566 transitions, 1146 flow. Second operand has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-08 21:35:03,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:03,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 592 [2025-03-08 21:35:03,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:05,549 INFO L124 PetriNetUnfolderBase]: 3671/15095 cut-off events. [2025-03-08 21:35:05,550 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-08 21:35:05,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22146 conditions, 15095 events. 3671/15095 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 136781 event pairs, 3314 based on Foata normal form. 0/13635 useless extension candidates. Maximal degree in co-relation 22041. Up to 6868 conditions per place. [2025-03-08 21:35:05,608 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 138 selfloop transitions, 5 changer transitions 0/565 dead transitions. [2025-03-08 21:35:05,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 565 transitions, 1430 flow [2025-03-08 21:35:05,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2766 transitions. [2025-03-08 21:35:05,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787162162162162 [2025-03-08 21:35:05,615 INFO L175 Difference]: Start difference. First operand has 565 places, 566 transitions, 1146 flow. Second operand 6 states and 2766 transitions. [2025-03-08 21:35:05,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 565 transitions, 1430 flow [2025-03-08 21:35:05,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 565 transitions, 1420 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:05,624 INFO L231 Difference]: Finished difference. Result has 564 places, 565 transitions, 1144 flow [2025-03-08 21:35:05,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1144, PETRI_PLACES=564, PETRI_TRANSITIONS=565} [2025-03-08 21:35:05,627 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -6 predicate places. [2025-03-08 21:35:05,627 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 565 transitions, 1144 flow [2025-03-08 21:35:05,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-08 21:35:05,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:05,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:05,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:35:05,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:05,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:05,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1125698543, now seen corresponding path program 1 times [2025-03-08 21:35:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:05,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872668771] [2025-03-08 21:35:05,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:05,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:05,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 21:35:05,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 21:35:05,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:05,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:06,220 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-08 21:35:06,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872668771] [2025-03-08 21:35:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872668771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:06,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:06,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:06,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917481418] [2025-03-08 21:35:06,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:06,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:06,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:06,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:06,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:06,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 592 [2025-03-08 21:35:06,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 565 transitions, 1144 flow. Second operand has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-08 21:35:06,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:06,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 592 [2025-03-08 21:35:06,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:08,884 INFO L124 PetriNetUnfolderBase]: 3671/15094 cut-off events. [2025-03-08 21:35:08,884 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-08 21:35:08,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22145 conditions, 15094 events. 3671/15094 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 136978 event pairs, 3314 based on Foata normal form. 0/13635 useless extension candidates. Maximal degree in co-relation 22032. Up to 6868 conditions per place. [2025-03-08 21:35:08,995 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 138 selfloop transitions, 5 changer transitions 0/564 dead transitions. [2025-03-08 21:35:08,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 564 transitions, 1428 flow [2025-03-08 21:35:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2766 transitions. [2025-03-08 21:35:09,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787162162162162 [2025-03-08 21:35:09,001 INFO L175 Difference]: Start difference. First operand has 564 places, 565 transitions, 1144 flow. Second operand 6 states and 2766 transitions. [2025-03-08 21:35:09,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 564 transitions, 1428 flow [2025-03-08 21:35:09,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 564 transitions, 1418 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:09,010 INFO L231 Difference]: Finished difference. Result has 563 places, 564 transitions, 1142 flow [2025-03-08 21:35:09,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1142, PETRI_PLACES=563, PETRI_TRANSITIONS=564} [2025-03-08 21:35:09,013 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -7 predicate places. [2025-03-08 21:35:09,014 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 564 transitions, 1142 flow [2025-03-08 21:35:09,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.3333333333333) internal successors, (2630), 6 states have internal predecessors, (2630), 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-08 21:35:09,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:09,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:09,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:35:09,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1179369503, now seen corresponding path program 1 times [2025-03-08 21:35:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420376992] [2025-03-08 21:35:09,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:09,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 21:35:09,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 21:35:09,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:09,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:35:09,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420376992] [2025-03-08 21:35:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420376992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:09,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:09,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:09,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097859855] [2025-03-08 21:35:09,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:09,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:09,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:09,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:10,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-08 21:35:10,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 564 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 502.1666666666667) internal successors, (3013), 6 states have internal predecessors, (3013), 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-08 21:35:10,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:10,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-08 21:35:10,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:11,112 INFO L124 PetriNetUnfolderBase]: 831/5612 cut-off events. [2025-03-08 21:35:11,112 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 21:35:11,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7190 conditions, 5612 events. 831/5612 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 45618 event pairs, 674 based on Foata normal form. 0/5003 useless extension candidates. Maximal degree in co-relation 7059. Up to 1475 conditions per place. [2025-03-08 21:35:11,135 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 76 selfloop transitions, 5 changer transitions 0/563 dead transitions. [2025-03-08 21:35:11,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 563 transitions, 1302 flow [2025-03-08 21:35:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3076 transitions. [2025-03-08 21:35:11,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865990990990991 [2025-03-08 21:35:11,141 INFO L175 Difference]: Start difference. First operand has 563 places, 564 transitions, 1142 flow. Second operand 6 states and 3076 transitions. [2025-03-08 21:35:11,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 563 transitions, 1302 flow [2025-03-08 21:35:11,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 563 transitions, 1292 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:11,147 INFO L231 Difference]: Finished difference. Result has 562 places, 563 transitions, 1140 flow [2025-03-08 21:35:11,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1140, PETRI_PLACES=562, PETRI_TRANSITIONS=563} [2025-03-08 21:35:11,148 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -8 predicate places. [2025-03-08 21:35:11,149 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 563 transitions, 1140 flow [2025-03-08 21:35:11,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 502.1666666666667) internal successors, (3013), 6 states have internal predecessors, (3013), 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-08 21:35:11,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:11,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:11,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:35:11,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:11,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:11,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1298725753, now seen corresponding path program 1 times [2025-03-08 21:35:11,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:11,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688571355] [2025-03-08 21:35:11,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:11,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:11,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 21:35:11,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 21:35:11,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:11,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:35:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688571355] [2025-03-08 21:35:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688571355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:11,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318161842] [2025-03-08 21:35:11,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:11,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:11,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:11,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:12,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-08 21:35:12,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 563 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 502.1666666666667) internal successors, (3013), 6 states have internal predecessors, (3013), 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-08 21:35:12,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:12,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-08 21:35:12,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:12,934 INFO L124 PetriNetUnfolderBase]: 831/5611 cut-off events. [2025-03-08 21:35:12,934 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 21:35:12,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 5611 events. 831/5611 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 45465 event pairs, 674 based on Foata normal form. 0/5003 useless extension candidates. Maximal degree in co-relation 7020. Up to 1475 conditions per place. [2025-03-08 21:35:12,957 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 76 selfloop transitions, 5 changer transitions 0/562 dead transitions. [2025-03-08 21:35:12,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 562 transitions, 1300 flow [2025-03-08 21:35:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3076 transitions. [2025-03-08 21:35:12,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865990990990991 [2025-03-08 21:35:12,965 INFO L175 Difference]: Start difference. First operand has 562 places, 563 transitions, 1140 flow. Second operand 6 states and 3076 transitions. [2025-03-08 21:35:12,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 562 transitions, 1300 flow [2025-03-08 21:35:12,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 562 transitions, 1290 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:12,970 INFO L231 Difference]: Finished difference. Result has 561 places, 562 transitions, 1138 flow [2025-03-08 21:35:12,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1138, PETRI_PLACES=561, PETRI_TRANSITIONS=562} [2025-03-08 21:35:12,972 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -9 predicate places. [2025-03-08 21:35:12,972 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 562 transitions, 1138 flow [2025-03-08 21:35:12,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 502.1666666666667) internal successors, (3013), 6 states have internal predecessors, (3013), 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-08 21:35:12,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:12,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:12,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:35:12,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:12,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:12,975 INFO L85 PathProgramCache]: Analyzing trace with hash -208833624, now seen corresponding path program 1 times [2025-03-08 21:35:12,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:12,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423003704] [2025-03-08 21:35:12,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:12,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:12,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 21:35:13,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 21:35:13,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:13,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:35:13,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:13,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423003704] [2025-03-08 21:35:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423003704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009218601] [2025-03-08 21:35:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:13,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:13,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:13,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:13,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 592 [2025-03-08 21:35:13,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 562 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 568.0) internal successors, (1704), 3 states have internal predecessors, (1704), 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-08 21:35:13,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:13,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 592 [2025-03-08 21:35:13,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:13,421 INFO L124 PetriNetUnfolderBase]: 114/2678 cut-off events. [2025-03-08 21:35:13,421 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 21:35:13,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 2678 events. 114/2678 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 13939 event pairs, 25 based on Foata normal form. 0/2382 useless extension candidates. Maximal degree in co-relation 2695. Up to 88 conditions per place. [2025-03-08 21:35:13,437 INFO L140 encePairwiseOnDemand]: 587/592 looper letters, 22 selfloop transitions, 4 changer transitions 0/573 dead transitions. [2025-03-08 21:35:13,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 573 transitions, 1213 flow [2025-03-08 21:35:13,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1725 transitions. [2025-03-08 21:35:13,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9712837837837838 [2025-03-08 21:35:13,441 INFO L175 Difference]: Start difference. First operand has 561 places, 562 transitions, 1138 flow. Second operand 3 states and 1725 transitions. [2025-03-08 21:35:13,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 573 transitions, 1213 flow [2025-03-08 21:35:13,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 573 transitions, 1203 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:13,450 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1162 flow [2025-03-08 21:35:13,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=560, PETRI_TRANSITIONS=566} [2025-03-08 21:35:13,454 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -10 predicate places. [2025-03-08 21:35:13,454 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1162 flow [2025-03-08 21:35:13,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.0) internal successors, (1704), 3 states have internal predecessors, (1704), 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-08 21:35:13,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:13,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:13,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:35:13,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:13,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1308442786, now seen corresponding path program 1 times [2025-03-08 21:35:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:13,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676801798] [2025-03-08 21:35:13,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:13,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 21:35:13,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 21:35:13,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:13,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 21:35:13,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676801798] [2025-03-08 21:35:13,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676801798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:13,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:13,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:13,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934766124] [2025-03-08 21:35:13,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:13,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:13,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:13,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:13,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:14,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 592 [2025-03-08 21:35:14,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 566 transitions, 1162 flow. Second operand has 6 states, 6 states have (on average 473.5) internal successors, (2841), 6 states have internal predecessors, (2841), 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-08 21:35:14,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:14,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 592 [2025-03-08 21:35:14,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:16,865 INFO L124 PetriNetUnfolderBase]: 3091/15503 cut-off events. [2025-03-08 21:35:16,866 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-03-08 21:35:16,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21715 conditions, 15503 events. 3091/15503 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 143894 event pairs, 1173 based on Foata normal form. 0/13921 useless extension candidates. Maximal degree in co-relation 20891. Up to 4480 conditions per place. [2025-03-08 21:35:16,921 INFO L140 encePairwiseOnDemand]: 538/592 looper letters, 125 selfloop transitions, 84 changer transitions 0/664 dead transitions. [2025-03-08 21:35:16,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 664 transitions, 1784 flow [2025-03-08 21:35:16,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3035 transitions. [2025-03-08 21:35:16,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8544481981981982 [2025-03-08 21:35:16,926 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1162 flow. Second operand 6 states and 3035 transitions. [2025-03-08 21:35:16,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 664 transitions, 1784 flow [2025-03-08 21:35:16,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 664 transitions, 1776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:16,935 INFO L231 Difference]: Finished difference. Result has 568 places, 646 transitions, 1750 flow [2025-03-08 21:35:16,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1750, PETRI_PLACES=568, PETRI_TRANSITIONS=646} [2025-03-08 21:35:16,936 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -2 predicate places. [2025-03-08 21:35:16,936 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 646 transitions, 1750 flow [2025-03-08 21:35:16,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 473.5) internal successors, (2841), 6 states have internal predecessors, (2841), 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-08 21:35:16,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:16,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:16,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:35:16,938 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:16,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2131945807, now seen corresponding path program 1 times [2025-03-08 21:35:16,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:16,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044052303] [2025-03-08 21:35:16,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:16,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 21:35:16,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 21:35:16,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:16,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:35:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044052303] [2025-03-08 21:35:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044052303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:17,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:17,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:35:17,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258521836] [2025-03-08 21:35:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:17,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:17,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:17,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:17,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 592 [2025-03-08 21:35:17,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 646 transitions, 1750 flow. Second operand has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 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-08 21:35:17,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:17,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 592 [2025-03-08 21:35:17,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:18,782 INFO L124 PetriNetUnfolderBase]: 991/8750 cut-off events. [2025-03-08 21:35:18,782 INFO L125 PetriNetUnfolderBase]: For 621/633 co-relation queries the response was YES. [2025-03-08 21:35:18,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12490 conditions, 8750 events. 991/8750 cut-off events. For 621/633 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 73964 event pairs, 110 based on Foata normal form. 24/7986 useless extension candidates. Maximal degree in co-relation 11810. Up to 966 conditions per place. [2025-03-08 21:35:18,811 INFO L140 encePairwiseOnDemand]: 588/592 looper letters, 18 selfloop transitions, 3 changer transitions 0/634 dead transitions. [2025-03-08 21:35:18,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 634 transitions, 1719 flow [2025-03-08 21:35:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1723 transitions. [2025-03-08 21:35:18,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701576576576577 [2025-03-08 21:35:18,814 INFO L175 Difference]: Start difference. First operand has 568 places, 646 transitions, 1750 flow. Second operand 3 states and 1723 transitions. [2025-03-08 21:35:18,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 634 transitions, 1719 flow [2025-03-08 21:35:18,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 634 transitions, 1705 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:18,829 INFO L231 Difference]: Finished difference. Result has 568 places, 628 transitions, 1661 flow [2025-03-08 21:35:18,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1661, PETRI_PLACES=568, PETRI_TRANSITIONS=628} [2025-03-08 21:35:18,831 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, -2 predicate places. [2025-03-08 21:35:18,831 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 628 transitions, 1661 flow [2025-03-08 21:35:18,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.0) internal successors, (1707), 3 states have internal predecessors, (1707), 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-08 21:35:18,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:18,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:18,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:35:18,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 300033979, now seen corresponding path program 1 times [2025-03-08 21:35:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938813224] [2025-03-08 21:35:18,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:18,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 21:35:18,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 21:35:18,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:18,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:35:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938813224] [2025-03-08 21:35:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938813224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482598059] [2025-03-08 21:35:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:19,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:19,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:19,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:19,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 592 [2025-03-08 21:35:19,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 628 transitions, 1661 flow. Second operand has 6 states, 6 states have (on average 423.8333333333333) internal successors, (2543), 6 states have internal predecessors, (2543), 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-08 21:35:19,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:19,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 592 [2025-03-08 21:35:19,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:23,644 INFO L124 PetriNetUnfolderBase]: 6038/22406 cut-off events. [2025-03-08 21:35:23,644 INFO L125 PetriNetUnfolderBase]: For 4253/4484 co-relation queries the response was YES. [2025-03-08 21:35:23,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40984 conditions, 22406 events. 6038/22406 cut-off events. For 4253/4484 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 222007 event pairs, 3626 based on Foata normal form. 30/20391 useless extension candidates. Maximal degree in co-relation 39596. Up to 11092 conditions per place. [2025-03-08 21:35:23,959 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 228 selfloop transitions, 156 changer transitions 0/788 dead transitions. [2025-03-08 21:35:23,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 788 transitions, 2853 flow [2025-03-08 21:35:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2833 transitions. [2025-03-08 21:35:23,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975788288288288 [2025-03-08 21:35:23,962 INFO L175 Difference]: Start difference. First operand has 568 places, 628 transitions, 1661 flow. Second operand 6 states and 2833 transitions. [2025-03-08 21:35:23,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 788 transitions, 2853 flow [2025-03-08 21:35:23,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 788 transitions, 2850 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:23,977 INFO L231 Difference]: Finished difference. Result has 576 places, 776 transitions, 2758 flow [2025-03-08 21:35:23,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2758, PETRI_PLACES=576, PETRI_TRANSITIONS=776} [2025-03-08 21:35:23,979 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 6 predicate places. [2025-03-08 21:35:23,979 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 776 transitions, 2758 flow [2025-03-08 21:35:23,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.8333333333333) internal successors, (2543), 6 states have internal predecessors, (2543), 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-08 21:35:23,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:23,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:23,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:35:23,980 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:23,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash -645065793, now seen corresponding path program 1 times [2025-03-08 21:35:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641746509] [2025-03-08 21:35:23,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:23,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 21:35:24,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 21:35:24,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:24,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:35:24,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:24,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641746509] [2025-03-08 21:35:24,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641746509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:24,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:24,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:24,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698552857] [2025-03-08 21:35:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:24,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:24,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:24,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:24,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:25,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 592 [2025-03-08 21:35:25,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 776 transitions, 2758 flow. Second operand has 6 states, 6 states have (on average 508.1666666666667) internal successors, (3049), 6 states have internal predecessors, (3049), 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-08 21:35:25,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:25,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 592 [2025-03-08 21:35:25,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:27,834 INFO L124 PetriNetUnfolderBase]: 2816/14526 cut-off events. [2025-03-08 21:35:27,834 INFO L125 PetriNetUnfolderBase]: For 4557/5238 co-relation queries the response was YES. [2025-03-08 21:35:27,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27626 conditions, 14526 events. 2816/14526 cut-off events. For 4557/5238 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 139658 event pairs, 749 based on Foata normal form. 51/13285 useless extension candidates. Maximal degree in co-relation 26599. Up to 3595 conditions per place. [2025-03-08 21:35:27,934 INFO L140 encePairwiseOnDemand]: 567/592 looper letters, 182 selfloop transitions, 59 changer transitions 0/840 dead transitions. [2025-03-08 21:35:27,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 840 transitions, 3568 flow [2025-03-08 21:35:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3167 transitions. [2025-03-08 21:35:27,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916103603603603 [2025-03-08 21:35:27,938 INFO L175 Difference]: Start difference. First operand has 576 places, 776 transitions, 2758 flow. Second operand 6 states and 3167 transitions. [2025-03-08 21:35:27,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 840 transitions, 3568 flow [2025-03-08 21:35:27,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 840 transitions, 3472 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:27,974 INFO L231 Difference]: Finished difference. Result has 585 places, 828 transitions, 3230 flow [2025-03-08 21:35:27,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=2660, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3230, PETRI_PLACES=585, PETRI_TRANSITIONS=828} [2025-03-08 21:35:27,975 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 15 predicate places. [2025-03-08 21:35:27,975 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 828 transitions, 3230 flow [2025-03-08 21:35:27,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 508.1666666666667) internal successors, (3049), 6 states have internal predecessors, (3049), 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-08 21:35:27,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:27,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:27,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:35:27,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:27,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1367281731, now seen corresponding path program 1 times [2025-03-08 21:35:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:27,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056695754] [2025-03-08 21:35:27,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:28,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 21:35:28,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 21:35:28,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:28,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:35:28,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056695754] [2025-03-08 21:35:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056695754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372542668] [2025-03-08 21:35:28,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:28,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:28,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:28,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:29,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 592 [2025-03-08 21:35:29,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 828 transitions, 3230 flow. Second operand has 6 states, 6 states have (on average 466.5) internal successors, (2799), 6 states have internal predecessors, (2799), 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-08 21:35:29,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:29,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 592 [2025-03-08 21:35:29,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:32,422 INFO L124 PetriNetUnfolderBase]: 4710/19221 cut-off events. [2025-03-08 21:35:32,423 INFO L125 PetriNetUnfolderBase]: For 8446/8780 co-relation queries the response was YES. [2025-03-08 21:35:32,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41220 conditions, 19221 events. 4710/19221 cut-off events. For 8446/8780 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 188981 event pairs, 1581 based on Foata normal form. 59/17632 useless extension candidates. Maximal degree in co-relation 40081. Up to 7811 conditions per place. [2025-03-08 21:35:32,520 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 374 selfloop transitions, 156 changer transitions 0/988 dead transitions. [2025-03-08 21:35:32,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 988 transitions, 5098 flow [2025-03-08 21:35:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3043 transitions. [2025-03-08 21:35:32,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567004504504504 [2025-03-08 21:35:32,524 INFO L175 Difference]: Start difference. First operand has 585 places, 828 transitions, 3230 flow. Second operand 6 states and 3043 transitions. [2025-03-08 21:35:32,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 988 transitions, 5098 flow [2025-03-08 21:35:32,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 988 transitions, 5002 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:32,562 INFO L231 Difference]: Finished difference. Result has 594 places, 976 transitions, 4618 flow [2025-03-08 21:35:32,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=3132, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4618, PETRI_PLACES=594, PETRI_TRANSITIONS=976} [2025-03-08 21:35:32,565 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 24 predicate places. [2025-03-08 21:35:32,565 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 976 transitions, 4618 flow [2025-03-08 21:35:32,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 466.5) internal successors, (2799), 6 states have internal predecessors, (2799), 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-08 21:35:32,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:32,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:32,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:35:32,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:32,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1586444398, now seen corresponding path program 1 times [2025-03-08 21:35:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:32,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773141670] [2025-03-08 21:35:32,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:32,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 21:35:32,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 21:35:32,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:32,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:35:32,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773141670] [2025-03-08 21:35:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773141670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5412578] [2025-03-08 21:35:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:32,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:32,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:33,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 592 [2025-03-08 21:35:33,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 976 transitions, 4618 flow. Second operand has 6 states, 6 states have (on average 437.3333333333333) internal successors, (2624), 6 states have internal predecessors, (2624), 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-08 21:35:33,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:33,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 592 [2025-03-08 21:35:33,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:38,937 INFO L124 PetriNetUnfolderBase]: 7085/25823 cut-off events. [2025-03-08 21:35:38,937 INFO L125 PetriNetUnfolderBase]: For 18989/19407 co-relation queries the response was YES. [2025-03-08 21:35:39,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63028 conditions, 25823 events. 7085/25823 cut-off events. For 18989/19407 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 262278 event pairs, 2895 based on Foata normal form. 58/23776 useless extension candidates. Maximal degree in co-relation 61630. Up to 11984 conditions per place. [2025-03-08 21:35:39,088 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 558 selfloop transitions, 156 changer transitions 0/1136 dead transitions. [2025-03-08 21:35:39,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 1136 transitions, 7142 flow [2025-03-08 21:35:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2893 transitions. [2025-03-08 21:35:39,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8144707207207207 [2025-03-08 21:35:39,091 INFO L175 Difference]: Start difference. First operand has 594 places, 976 transitions, 4618 flow. Second operand 6 states and 2893 transitions. [2025-03-08 21:35:39,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 1136 transitions, 7142 flow [2025-03-08 21:35:39,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 1136 transitions, 6662 flow, removed 240 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:39,141 INFO L231 Difference]: Finished difference. Result has 603 places, 1124 transitions, 5910 flow [2025-03-08 21:35:39,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=4136, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5910, PETRI_PLACES=603, PETRI_TRANSITIONS=1124} [2025-03-08 21:35:39,142 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 33 predicate places. [2025-03-08 21:35:39,142 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 1124 transitions, 5910 flow [2025-03-08 21:35:39,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.3333333333333) internal successors, (2624), 6 states have internal predecessors, (2624), 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-08 21:35:39,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:39,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:39,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:35:39,143 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:39,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -601568638, now seen corresponding path program 1 times [2025-03-08 21:35:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205674655] [2025-03-08 21:35:39,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:39,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 21:35:39,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 21:35:39,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:39,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:35:39,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:39,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205674655] [2025-03-08 21:35:39,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205674655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:39,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:39,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110818923] [2025-03-08 21:35:39,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:39,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:39,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:39,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:40,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 592 [2025-03-08 21:35:40,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 1124 transitions, 5910 flow. Second operand has 6 states, 6 states have (on average 438.1666666666667) internal successors, (2629), 6 states have internal predecessors, (2629), 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-08 21:35:40,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:40,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 592 [2025-03-08 21:35:40,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:46,091 INFO L124 PetriNetUnfolderBase]: 7511/26884 cut-off events. [2025-03-08 21:35:46,091 INFO L125 PetriNetUnfolderBase]: For 28720/29226 co-relation queries the response was YES. [2025-03-08 21:35:46,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72169 conditions, 26884 events. 7511/26884 cut-off events. For 28720/29226 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 273401 event pairs, 2522 based on Foata normal form. 60/24829 useless extension candidates. Maximal degree in co-relation 70749. Up to 12642 conditions per place. [2025-03-08 21:35:46,318 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 706 selfloop transitions, 156 changer transitions 0/1284 dead transitions. [2025-03-08 21:35:46,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 1284 transitions, 9018 flow [2025-03-08 21:35:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2893 transitions. [2025-03-08 21:35:46,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8144707207207207 [2025-03-08 21:35:46,322 INFO L175 Difference]: Start difference. First operand has 603 places, 1124 transitions, 5910 flow. Second operand 6 states and 2893 transitions. [2025-03-08 21:35:46,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 1284 transitions, 9018 flow [2025-03-08 21:35:46,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 1284 transitions, 8250 flow, removed 384 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:46,391 INFO L231 Difference]: Finished difference. Result has 612 places, 1272 transitions, 7202 flow [2025-03-08 21:35:46,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=5140, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1075, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7202, PETRI_PLACES=612, PETRI_TRANSITIONS=1272} [2025-03-08 21:35:46,392 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 42 predicate places. [2025-03-08 21:35:46,392 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 1272 transitions, 7202 flow [2025-03-08 21:35:46,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.1666666666667) internal successors, (2629), 6 states have internal predecessors, (2629), 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-08 21:35:46,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:46,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:46,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:35:46,393 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:46,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash -823485203, now seen corresponding path program 1 times [2025-03-08 21:35:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821851509] [2025-03-08 21:35:46,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:46,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 21:35:46,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 21:35:46,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:46,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:35:46,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:46,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821851509] [2025-03-08 21:35:46,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821851509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:46,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:46,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:46,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604972666] [2025-03-08 21:35:46,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:46,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:46,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:46,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:46,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:47,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 592 [2025-03-08 21:35:47,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 1272 transitions, 7202 flow. Second operand has 6 states, 6 states have (on average 439.8333333333333) internal successors, (2639), 6 states have internal predecessors, (2639), 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-08 21:35:47,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:47,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 592 [2025-03-08 21:35:47,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:52,832 INFO L124 PetriNetUnfolderBase]: 7133/25766 cut-off events. [2025-03-08 21:35:52,832 INFO L125 PetriNetUnfolderBase]: For 36887/37552 co-relation queries the response was YES. [2025-03-08 21:35:52,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74741 conditions, 25766 events. 7133/25766 cut-off events. For 36887/37552 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 261388 event pairs, 2299 based on Foata normal form. 10/23840 useless extension candidates. Maximal degree in co-relation 73287. Up to 12670 conditions per place. [2025-03-08 21:35:53,006 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 857 selfloop transitions, 5 changer transitions 0/1283 dead transitions. [2025-03-08 21:35:53,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 1283 transitions, 8956 flow [2025-03-08 21:35:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2748 transitions. [2025-03-08 21:35:53,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7736486486486487 [2025-03-08 21:35:53,010 INFO L175 Difference]: Start difference. First operand has 612 places, 1272 transitions, 7202 flow. Second operand 6 states and 2748 transitions. [2025-03-08 21:35:53,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 1283 transitions, 8956 flow [2025-03-08 21:35:53,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 1283 transitions, 7900 flow, removed 528 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:53,096 INFO L231 Difference]: Finished difference. Result has 616 places, 1271 transitions, 6154 flow [2025-03-08 21:35:53,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=6144, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6154, PETRI_PLACES=616, PETRI_TRANSITIONS=1271} [2025-03-08 21:35:53,097 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 46 predicate places. [2025-03-08 21:35:53,097 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 1271 transitions, 6154 flow [2025-03-08 21:35:53,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 439.8333333333333) internal successors, (2639), 6 states have internal predecessors, (2639), 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-08 21:35:53,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:53,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:53,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:35:53,098 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:53,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:53,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1455601514, now seen corresponding path program 1 times [2025-03-08 21:35:53,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:53,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122260512] [2025-03-08 21:35:53,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:53,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-08 21:35:53,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-08 21:35:53,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:53,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:35:53,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:53,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122260512] [2025-03-08 21:35:53,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122260512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:53,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:53,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320556710] [2025-03-08 21:35:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:53,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:53,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:53,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:54,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-08 21:35:54,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 1271 transitions, 6154 flow. Second operand has 6 states, 6 states have (on average 505.1666666666667) internal successors, (3031), 6 states have internal predecessors, (3031), 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-08 21:35:54,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:54,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-08 21:35:54,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:58,283 INFO L124 PetriNetUnfolderBase]: 5091/20469 cut-off events. [2025-03-08 21:35:58,284 INFO L125 PetriNetUnfolderBase]: For 25539/26035 co-relation queries the response was YES. [2025-03-08 21:35:58,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54392 conditions, 20469 events. 5091/20469 cut-off events. For 25539/26035 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 203955 event pairs, 719 based on Foata normal form. 90/19053 useless extension candidates. Maximal degree in co-relation 53197. Up to 5720 conditions per place. [2025-03-08 21:35:58,427 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 392 selfloop transitions, 5 changer transitions 0/1282 dead transitions. [2025-03-08 21:35:58,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 1282 transitions, 6978 flow [2025-03-08 21:35:58,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3088 transitions. [2025-03-08 21:35:58,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693693693693694 [2025-03-08 21:35:58,432 INFO L175 Difference]: Start difference. First operand has 616 places, 1271 transitions, 6154 flow. Second operand 6 states and 3088 transitions. [2025-03-08 21:35:58,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 1282 transitions, 6978 flow [2025-03-08 21:35:58,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 1282 transitions, 6968 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:58,506 INFO L231 Difference]: Finished difference. Result has 615 places, 1270 transitions, 6152 flow [2025-03-08 21:35:58,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=6142, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6152, PETRI_PLACES=615, PETRI_TRANSITIONS=1270} [2025-03-08 21:35:58,507 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 45 predicate places. [2025-03-08 21:35:58,507 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 1270 transitions, 6152 flow [2025-03-08 21:35:58,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 505.1666666666667) internal successors, (3031), 6 states have internal predecessors, (3031), 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-08 21:35:58,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:58,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:58,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:35:58,508 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:35:58,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1055991597, now seen corresponding path program 1 times [2025-03-08 21:35:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174675474] [2025-03-08 21:35:58,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:58,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-08 21:35:58,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-08 21:35:58,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:58,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:35:58,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:58,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174675474] [2025-03-08 21:35:58,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174675474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:58,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:58,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:58,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056124783] [2025-03-08 21:35:58,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:58,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:58,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:58,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:58,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:59,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 592 [2025-03-08 21:35:59,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 1270 transitions, 6152 flow. Second operand has 6 states, 6 states have (on average 505.1666666666667) internal successors, (3031), 6 states have internal predecessors, (3031), 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-08 21:35:59,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:59,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 592 [2025-03-08 21:35:59,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:03,536 INFO L124 PetriNetUnfolderBase]: 5091/20464 cut-off events. [2025-03-08 21:36:03,536 INFO L125 PetriNetUnfolderBase]: For 25539/26035 co-relation queries the response was YES. [2025-03-08 21:36:03,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54387 conditions, 20464 events. 5091/20464 cut-off events. For 25539/26035 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 203743 event pairs, 719 based on Foata normal form. 90/19053 useless extension candidates. Maximal degree in co-relation 53193. Up to 5720 conditions per place. [2025-03-08 21:36:03,683 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 392 selfloop transitions, 5 changer transitions 0/1281 dead transitions. [2025-03-08 21:36:03,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 1281 transitions, 6976 flow [2025-03-08 21:36:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:36:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:36:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3088 transitions. [2025-03-08 21:36:03,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693693693693694 [2025-03-08 21:36:03,686 INFO L175 Difference]: Start difference. First operand has 615 places, 1270 transitions, 6152 flow. Second operand 6 states and 3088 transitions. [2025-03-08 21:36:03,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 1281 transitions, 6976 flow [2025-03-08 21:36:03,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 1281 transitions, 6966 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:36:03,746 INFO L231 Difference]: Finished difference. Result has 614 places, 1269 transitions, 6150 flow [2025-03-08 21:36:03,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=6140, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6150, PETRI_PLACES=614, PETRI_TRANSITIONS=1269} [2025-03-08 21:36:03,747 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 44 predicate places. [2025-03-08 21:36:03,747 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 1269 transitions, 6150 flow [2025-03-08 21:36:03,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 505.1666666666667) internal successors, (3031), 6 states have internal predecessors, (3031), 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-08 21:36:03,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:03,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:36:03,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:36:03,748 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:36:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1031411653, now seen corresponding path program 1 times [2025-03-08 21:36:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445083047] [2025-03-08 21:36:03,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:03,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 21:36:03,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 21:36:03,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:03,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 21:36:03,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:03,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445083047] [2025-03-08 21:36:03,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445083047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:03,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:03,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:03,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309839750] [2025-03-08 21:36:03,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:03,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:03,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:03,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:03,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:03,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 592 [2025-03-08 21:36:03,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 1269 transitions, 6150 flow. Second operand has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 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-08 21:36:03,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:03,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 592 [2025-03-08 21:36:03,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:09,125 INFO L124 PetriNetUnfolderBase]: 6707/26997 cut-off events. [2025-03-08 21:36:09,126 INFO L125 PetriNetUnfolderBase]: For 27338/27904 co-relation queries the response was YES. [2025-03-08 21:36:09,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66319 conditions, 26997 events. 6707/26997 cut-off events. For 27338/27904 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 258688 event pairs, 388 based on Foata normal form. 123/25200 useless extension candidates. Maximal degree in co-relation 65412. Up to 4697 conditions per place. [2025-03-08 21:36:09,303 INFO L140 encePairwiseOnDemand]: 587/592 looper letters, 21 selfloop transitions, 4 changer transitions 0/1279 dead transitions. [2025-03-08 21:36:09,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 1279 transitions, 6223 flow [2025-03-08 21:36:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1724 transitions. [2025-03-08 21:36:09,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9707207207207207 [2025-03-08 21:36:09,305 INFO L175 Difference]: Start difference. First operand has 614 places, 1269 transitions, 6150 flow. Second operand 3 states and 1724 transitions. [2025-03-08 21:36:09,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 1279 transitions, 6223 flow [2025-03-08 21:36:09,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 1279 transitions, 6213 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:36:09,393 INFO L231 Difference]: Finished difference. Result has 613 places, 1273 transitions, 6174 flow [2025-03-08 21:36:09,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=592, PETRI_DIFFERENCE_MINUEND_FLOW=6140, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6174, PETRI_PLACES=613, PETRI_TRANSITIONS=1273} [2025-03-08 21:36:09,394 INFO L279 CegarLoopForPetriNet]: 570 programPoint places, 43 predicate places. [2025-03-08 21:36:09,394 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 1273 transitions, 6174 flow [2025-03-08 21:36:09,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 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-08 21:36:09,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:09,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:36:09,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:36:09,394 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-08 21:36:09,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1170578586, now seen corresponding path program 1 times [2025-03-08 21:36:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:09,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089219731] [2025-03-08 21:36:09,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:09,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-08 21:36:09,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-08 21:36:09,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:09,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 21:36:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089219731] [2025-03-08 21:36:09,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089219731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:09,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:09,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:36:09,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620834628] [2025-03-08 21:36:09,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:09,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:36:09,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:09,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:36:09,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:36:10,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 592 [2025-03-08 21:36:10,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 1273 transitions, 6174 flow. Second operand has 6 states, 6 states have (on average 443.5) internal successors, (2661), 6 states have internal predecessors, (2661), 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-08 21:36:10,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:10,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 592 [2025-03-08 21:36:10,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand