/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:19:25,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:19:25,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:19:25,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:19:25,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:19:25,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:19:25,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:19:25,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:19:25,529 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:19:25,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:19:25,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:19:25,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:19:25,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:19:25,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:19:25,531 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:19:25,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:19:25,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:19:25,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:19:25,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:19:25,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:19:25,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:19:25,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:19:25,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:19:25,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:19:25,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:19:25,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:19:25,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:19:25,820 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:19:25,820 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:19:25,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2025-03-15 00:19:27,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b071b7216/0398446ca06044a5ba3e584b2dc723e5/FLAG555178a16 [2025-03-15 00:19:27,293 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:19:27,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2025-03-15 00:19:27,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b071b7216/0398446ca06044a5ba3e584b2dc723e5/FLAG555178a16 [2025-03-15 00:19:27,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b071b7216/0398446ca06044a5ba3e584b2dc723e5 [2025-03-15 00:19:27,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:19:27,597 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:19:27,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:19:27,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:19:27,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:19:27,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:19:27" (1/1) ... [2025-03-15 00:19:27,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779abb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:27, skipping insertion in model container [2025-03-15 00:19:27,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:19:27" (1/1) ... [2025-03-15 00:19:27,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:19:27,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:19:27,929 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:19:27,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:19:28,057 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:19:28,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28 WrapperNode [2025-03-15 00:19:28,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:19:28,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:19:28,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:19:28,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:19:28,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,117 INFO L138 Inliner]: procedures = 246, calls = 40, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 214 [2025-03-15 00:19:28,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:19:28,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:19:28,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:19:28,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:19:28,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:19:28,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:19:28,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:19:28,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:19:28,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (1/1) ... [2025-03-15 00:19:28,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:19:28,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:19:28,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:19:28,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:19:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-15 00:19:28,231 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-15 00:19:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-15 00:19:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-15 00:19:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:19:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:19:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:19:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:19:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:19:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-15 00:19:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:19:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:19:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:19:28,233 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:19:28,437 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:19:28,439 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:19:28,787 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:19:28,787 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:19:28,804 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:19:28,805 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:19:28,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:19:28 BoogieIcfgContainer [2025-03-15 00:19:28,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:19:28,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:19:28,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:19:28,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:19:28,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:19:27" (1/3) ... [2025-03-15 00:19:28,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50da689f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:19:28, skipping insertion in model container [2025-03-15 00:19:28,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:19:28" (2/3) ... [2025-03-15 00:19:28,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50da689f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:19:28, skipping insertion in model container [2025-03-15 00:19:28,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:19:28" (3/3) ... [2025-03-15 00:19:28,813 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2025-03-15 00:19:28,828 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:19:28,829 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_1-container_of.i that has 2 procedures, 288 locations, 1 initial locations, 0 loop locations, and 17 error locations. [2025-03-15 00:19:28,829 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:19:28,904 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:19:28,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:19:28,953 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=All, 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;@46157ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:19:28,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-15 00:19:28,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:19:28,977 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-03-15 00:19:28,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:19:28,982 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:19:28,983 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:19:28,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:19:28,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:19:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash -566184835, now seen corresponding path program 1 times [2025-03-15 00:19:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:19:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618774367] [2025-03-15 00:19:28,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:19:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:19:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:19:29,783 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-15 00:19:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:19:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618774367] [2025-03-15 00:19:29,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618774367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:19:29,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:19:29,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:19:29,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225513951] [2025-03-15 00:19:29,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:19:29,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:19:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:19:29,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:19:29,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:19:29,819 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 343 [2025-03-15 00:19:29,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 343 transitions, 700 flow. Second operand has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 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-15 00:19:29,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:19:29,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 343 [2025-03-15 00:19:29,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:19:35,253 INFO L124 PetriNetUnfolderBase]: 21442/44822 cut-off events. [2025-03-15 00:19:35,253 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-15 00:19:35,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77911 conditions, 44822 events. 21442/44822 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 442362 event pairs, 21440 based on Foata normal form. 1363/40300 useless extension candidates. Maximal degree in co-relation 77477. Up to 33015 conditions per place. [2025-03-15 00:19:35,831 INFO L140 encePairwiseOnDemand]: 325/343 looper letters, 109 selfloop transitions, 5 changer transitions 13/310 dead transitions. [2025-03-15 00:19:35,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 310 transitions, 860 flow [2025-03-15 00:19:35,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:19:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:19:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1387 transitions. [2025-03-15 00:19:35,867 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.673955296404276 [2025-03-15 00:19:35,871 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, -16 predicate places. [2025-03-15 00:19:35,871 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 310 transitions, 860 flow [2025-03-15 00:19:35,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 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-15 00:19:35,872 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:19:35,872 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:19:35,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:19:35,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:19:35,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:19:35,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1434413500, now seen corresponding path program 1 times [2025-03-15 00:19:35,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:19:35,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463818541] [2025-03-15 00:19:35,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:19:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:19:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:19:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:19:36,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:19:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463818541] [2025-03-15 00:19:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463818541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:19:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:19:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:19:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944034419] [2025-03-15 00:19:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:19:36,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:19:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:19:36,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:19:36,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:19:36,373 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 343 [2025-03-15 00:19:36,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 310 transitions, 860 flow. Second operand has 6 states, 6 states have (on average 212.83333333333334) internal successors, (1277), 6 states have internal predecessors, (1277), 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-15 00:19:36,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:19:36,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 343 [2025-03-15 00:19:36,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:19:40,873 INFO L124 PetriNetUnfolderBase]: 21442/44821 cut-off events. [2025-03-15 00:19:40,873 INFO L125 PetriNetUnfolderBase]: For 2274/5526 co-relation queries the response was YES. [2025-03-15 00:19:40,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110928 conditions, 44821 events. 21442/44821 cut-off events. For 2274/5526 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 443008 event pairs, 21440 based on Foata normal form. 0/38937 useless extension candidates. Maximal degree in co-relation 110383. Up to 33014 conditions per place. [2025-03-15 00:19:41,224 INFO L140 encePairwiseOnDemand]: 337/343 looper letters, 108 selfloop transitions, 5 changer transitions 13/309 dead transitions. [2025-03-15 00:19:41,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 309 transitions, 1082 flow [2025-03-15 00:19:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:19:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:19:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1374 transitions. [2025-03-15 00:19:41,228 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6676384839650146 [2025-03-15 00:19:41,229 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, -12 predicate places. [2025-03-15 00:19:41,229 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 309 transitions, 1082 flow [2025-03-15 00:19:41,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.83333333333334) internal successors, (1277), 6 states have internal predecessors, (1277), 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-15 00:19:41,230 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:19:41,230 INFO L221 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] [2025-03-15 00:19:41,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:19:41,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:19:41,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:19:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1172808996, now seen corresponding path program 1 times [2025-03-15 00:19:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:19:41,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036562879] [2025-03-15 00:19:41,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:19:41,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:19:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:19:41,605 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-15 00:19:41,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:19:41,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036562879] [2025-03-15 00:19:41,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036562879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:19:41,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:19:41,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:19:41,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630238337] [2025-03-15 00:19:41,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:19:41,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:19:41,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:19:41,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:19:41,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:19:41,608 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 343 [2025-03-15 00:19:41,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 309 transitions, 1082 flow. Second operand has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 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-15 00:19:41,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:19:41,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 343 [2025-03-15 00:19:41,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:19:46,520 INFO L124 PetriNetUnfolderBase]: 21442/44431 cut-off events. [2025-03-15 00:19:46,520 INFO L125 PetriNetUnfolderBase]: For 6285/9137 co-relation queries the response was YES. [2025-03-15 00:19:46,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143552 conditions, 44431 events. 21442/44431 cut-off events. For 6285/9137 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 437558 event pairs, 20418 based on Foata normal form. 0/38759 useless extension candidates. Maximal degree in co-relation 142900. Up to 33013 conditions per place. [2025-03-15 00:19:46,841 INFO L140 encePairwiseOnDemand]: 335/343 looper letters, 109 selfloop transitions, 7 changer transitions 13/314 dead transitions. [2025-03-15 00:19:46,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 314 transitions, 1347 flow [2025-03-15 00:19:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:19:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:19:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2025-03-15 00:19:46,845 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6749271137026239 [2025-03-15 00:19:46,845 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, -8 predicate places. [2025-03-15 00:19:46,845 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 314 transitions, 1347 flow [2025-03-15 00:19:46,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 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-15 00:19:46,847 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:19:46,847 INFO L221 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] [2025-03-15 00:19:46,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:19:46,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:19:46,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:19:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash 272122075, now seen corresponding path program 1 times [2025-03-15 00:19:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:19:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492852826] [2025-03-15 00:19:46,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:19:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:19:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:19:47,209 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-15 00:19:47,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:19:47,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492852826] [2025-03-15 00:19:47,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492852826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:19:47,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:19:47,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:19:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524578669] [2025-03-15 00:19:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:19:47,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:19:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:19:47,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:19:47,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:19:47,212 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 343 [2025-03-15 00:19:47,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 314 transitions, 1347 flow. Second operand has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 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-15 00:19:47,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:19:47,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 343 [2025-03-15 00:19:47,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:19:51,998 INFO L124 PetriNetUnfolderBase]: 21442/44099 cut-off events. [2025-03-15 00:19:51,998 INFO L125 PetriNetUnfolderBase]: For 11197/14215 co-relation queries the response was YES. [2025-03-15 00:19:52,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176232 conditions, 44099 events. 21442/44099 cut-off events. For 11197/14215 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 429592 event pairs, 19876 based on Foata normal form. 2/38491 useless extension candidates. Maximal degree in co-relation 175475. Up to 33012 conditions per place. [2025-03-15 00:19:52,379 INFO L140 encePairwiseOnDemand]: 335/343 looper letters, 108 selfloop transitions, 7 changer transitions 13/313 dead transitions. [2025-03-15 00:19:52,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 313 transitions, 1569 flow [2025-03-15 00:19:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:19:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:19:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1388 transitions. [2025-03-15 00:19:52,382 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.67444120505345 [2025-03-15 00:19:52,383 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, -4 predicate places. [2025-03-15 00:19:52,383 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 313 transitions, 1569 flow [2025-03-15 00:19:52,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 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-15 00:19:52,384 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:19:52,384 INFO L221 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-15 00:19:52,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:19:52,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:19:52,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:19:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash 632779931, now seen corresponding path program 1 times [2025-03-15 00:19:52,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:19:52,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422671649] [2025-03-15 00:19:52,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:19:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:19:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:19:52,447 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-15 00:19:52,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:19:52,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422671649] [2025-03-15 00:19:52,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422671649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:19:52,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:19:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:19:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486411602] [2025-03-15 00:19:52,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:19:52,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:19:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:19:52,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:19:52,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:19:52,449 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 343 [2025-03-15 00:19:52,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 313 transitions, 1569 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 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-15 00:19:52,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:19:52,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 343 [2025-03-15 00:19:52,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:19:57,852 INFO L124 PetriNetUnfolderBase]: 22743/47742 cut-off events. [2025-03-15 00:19:57,853 INFO L125 PetriNetUnfolderBase]: For 20347/25141 co-relation queries the response was YES. [2025-03-15 00:19:57,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192860 conditions, 47742 events. 22743/47742 cut-off events. For 20347/25141 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 479332 event pairs, 21654 based on Foata normal form. 0/41594 useless extension candidates. Maximal degree in co-relation 192061. Up to 35498 conditions per place. [2025-03-15 00:19:58,189 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 21 selfloop transitions, 2 changer transitions 13/314 dead transitions. [2025-03-15 00:19:58,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 314 transitions, 1633 flow [2025-03-15 00:19:58,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:19:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:19:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2025-03-15 00:19:58,191 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9144800777453839 [2025-03-15 00:19:58,194 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, -3 predicate places. [2025-03-15 00:19:58,194 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 314 transitions, 1633 flow [2025-03-15 00:19:58,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 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-15 00:19:58,195 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:19:58,195 INFO L221 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] [2025-03-15 00:19:58,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:19:58,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:19:58,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:19:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash 922456486, now seen corresponding path program 1 times [2025-03-15 00:19:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:19:58,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723583432] [2025-03-15 00:19:58,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:19:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:19:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:19:58,252 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-15 00:19:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:19:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723583432] [2025-03-15 00:19:58,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723583432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:19:58,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:19:58,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:19:58,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409280230] [2025-03-15 00:19:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:19:58,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:19:58,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:19:58,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:19:58,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:19:58,254 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 343 [2025-03-15 00:19:58,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 314 transitions, 1633 flow. Second operand has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 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-15 00:19:58,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:19:58,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 343 [2025-03-15 00:19:58,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:20:03,091 INFO L124 PetriNetUnfolderBase]: 22355/46221 cut-off events. [2025-03-15 00:20:03,091 INFO L125 PetriNetUnfolderBase]: For 28769/33640 co-relation queries the response was YES. [2025-03-15 00:20:03,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190686 conditions, 46221 events. 22355/46221 cut-off events. For 28769/33640 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 454581 event pairs, 20575 based on Foata normal form. 2/40237 useless extension candidates. Maximal degree in co-relation 189532. Up to 34689 conditions per place. [2025-03-15 00:20:03,475 INFO L140 encePairwiseOnDemand]: 341/343 looper letters, 20 selfloop transitions, 1 changer transitions 13/317 dead transitions. [2025-03-15 00:20:03,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 317 transitions, 1719 flow [2025-03-15 00:20:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:20:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:20:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2025-03-15 00:20:03,477 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.923226433430515 [2025-03-15 00:20:03,477 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, -2 predicate places. [2025-03-15 00:20:03,478 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 317 transitions, 1719 flow [2025-03-15 00:20:03,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 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-15 00:20:03,478 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:20:03,478 INFO L221 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] [2025-03-15 00:20:03,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:20:03,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:20:03,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:20:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1032264963, now seen corresponding path program 1 times [2025-03-15 00:20:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:20:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051217748] [2025-03-15 00:20:03,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:20:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:20:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:20:03,549 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-15 00:20:03,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:20:03,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051217748] [2025-03-15 00:20:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051217748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:20:03,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:20:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:20:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662458683] [2025-03-15 00:20:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:20:03,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:20:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:20:03,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:20:03,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:20:03,551 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 343 [2025-03-15 00:20:03,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 317 transitions, 1719 flow. Second operand has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 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-15 00:20:03,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:20:03,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 343 [2025-03-15 00:20:03,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:20:08,658 INFO L124 PetriNetUnfolderBase]: 22800/47340 cut-off events. [2025-03-15 00:20:08,658 INFO L125 PetriNetUnfolderBase]: For 43804/48858 co-relation queries the response was YES. [2025-03-15 00:20:08,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198520 conditions, 47340 events. 22800/47340 cut-off events. For 43804/48858 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 467227 event pairs, 20921 based on Foata normal form. 33/41249 useless extension candidates. Maximal degree in co-relation 197239. Up to 35541 conditions per place. [2025-03-15 00:20:09,050 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 31 selfloop transitions, 2 changer transitions 13/322 dead transitions. [2025-03-15 00:20:09,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 322 transitions, 1867 flow [2025-03-15 00:20:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:20:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:20:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2025-03-15 00:20:09,052 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9164237123420796 [2025-03-15 00:20:09,053 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, -1 predicate places. [2025-03-15 00:20:09,053 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 322 transitions, 1867 flow [2025-03-15 00:20:09,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 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-15 00:20:09,053 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:20:09,053 INFO L221 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] [2025-03-15 00:20:09,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:20:09,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:20:09,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:20:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1007656582, now seen corresponding path program 1 times [2025-03-15 00:20:09,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:20:09,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930259812] [2025-03-15 00:20:09,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:20:09,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:20:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:20:09,615 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-15 00:20:09,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:20:09,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930259812] [2025-03-15 00:20:09,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930259812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:20:09,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:20:09,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:20:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066427997] [2025-03-15 00:20:09,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:20:09,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:20:09,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:20:09,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:20:09,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:20:09,617 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 343 [2025-03-15 00:20:09,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 322 transitions, 1867 flow. Second operand has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-15 00:20:09,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:20:09,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 343 [2025-03-15 00:20:09,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:20:17,983 INFO L124 PetriNetUnfolderBase]: 36588/68841 cut-off events. [2025-03-15 00:20:17,983 INFO L125 PetriNetUnfolderBase]: For 103257/109442 co-relation queries the response was YES. [2025-03-15 00:20:18,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342423 conditions, 68841 events. 36588/68841 cut-off events. For 103257/109442 co-relation queries the response was YES. Maximal size of possible extension queue 1214. Compared 652417 event pairs, 27318 based on Foata normal form. 1/60533 useless extension candidates. Maximal degree in co-relation 340977. Up to 51228 conditions per place. [2025-03-15 00:20:18,658 INFO L140 encePairwiseOnDemand]: 312/343 looper letters, 196 selfloop transitions, 102 changer transitions 13/487 dead transitions. [2025-03-15 00:20:18,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 487 transitions, 4201 flow [2025-03-15 00:20:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:20:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:20:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1512 transitions. [2025-03-15 00:20:18,661 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7346938775510204 [2025-03-15 00:20:18,662 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 4 predicate places. [2025-03-15 00:20:18,662 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 487 transitions, 4201 flow [2025-03-15 00:20:18,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-15 00:20:18,663 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:20:18,663 INFO L221 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] [2025-03-15 00:20:18,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:20:18,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:20:18,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:20:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1102475059, now seen corresponding path program 1 times [2025-03-15 00:20:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:20:18,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450526644] [2025-03-15 00:20:18,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:20:18,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:20:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:20:18,946 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-15 00:20:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:20:18,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450526644] [2025-03-15 00:20:18,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450526644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:20:18,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:20:18,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:20:18,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409210644] [2025-03-15 00:20:18,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:20:18,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:20:18,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:20:18,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:20:18,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:20:18,948 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 343 [2025-03-15 00:20:18,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 487 transitions, 4201 flow. Second operand has 6 states, 6 states have (on average 219.16666666666666) internal successors, (1315), 6 states have internal predecessors, (1315), 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-15 00:20:18,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:20:18,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 343 [2025-03-15 00:20:18,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:20:32,414 INFO L124 PetriNetUnfolderBase]: 55640/102794 cut-off events. [2025-03-15 00:20:32,414 INFO L125 PetriNetUnfolderBase]: For 195611/207867 co-relation queries the response was YES. [2025-03-15 00:20:32,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560744 conditions, 102794 events. 55640/102794 cut-off events. For 195611/207867 co-relation queries the response was YES. Maximal size of possible extension queue 1579. Compared 998644 event pairs, 33096 based on Foata normal form. 40/91579 useless extension candidates. Maximal degree in co-relation 559149. Up to 72915 conditions per place. [2025-03-15 00:20:33,741 INFO L140 encePairwiseOnDemand]: 308/343 looper letters, 420 selfloop transitions, 217 changer transitions 13/836 dead transitions. [2025-03-15 00:20:33,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 836 transitions, 9917 flow [2025-03-15 00:20:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:20:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:20:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1577 transitions. [2025-03-15 00:20:33,744 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7662779397473275 [2025-03-15 00:20:33,745 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 9 predicate places. [2025-03-15 00:20:33,745 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 836 transitions, 9917 flow [2025-03-15 00:20:33,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.16666666666666) internal successors, (1315), 6 states have internal predecessors, (1315), 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-15 00:20:33,746 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:20:33,746 INFO L221 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] [2025-03-15 00:20:33,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:20:33,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:20:33,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:20:33,746 INFO L85 PathProgramCache]: Analyzing trace with hash 454624652, now seen corresponding path program 1 times [2025-03-15 00:20:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:20:33,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689340712] [2025-03-15 00:20:33,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:20:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:20:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:20:34,028 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-15 00:20:34,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:20:34,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689340712] [2025-03-15 00:20:34,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689340712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:20:34,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:20:34,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:20:34,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93333018] [2025-03-15 00:20:34,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:20:34,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:20:34,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:20:34,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:20:34,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:20:34,033 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 343 [2025-03-15 00:20:34,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 836 transitions, 9917 flow. Second operand has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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-15 00:20:34,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:20:34,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 343 [2025-03-15 00:20:34,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:20:52,929 INFO L124 PetriNetUnfolderBase]: 64121/116213 cut-off events. [2025-03-15 00:20:52,929 INFO L125 PetriNetUnfolderBase]: For 256638/279722 co-relation queries the response was YES. [2025-03-15 00:20:53,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724421 conditions, 116213 events. 64121/116213 cut-off events. For 256638/279722 co-relation queries the response was YES. Maximal size of possible extension queue 1774. Compared 1122488 event pairs, 32291 based on Foata normal form. 41/103897 useless extension candidates. Maximal degree in co-relation 722667. Up to 82683 conditions per place. [2025-03-15 00:20:54,174 INFO L140 encePairwiseOnDemand]: 312/343 looper letters, 758 selfloop transitions, 200 changer transitions 13/1149 dead transitions. [2025-03-15 00:20:54,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1149 transitions, 16383 flow [2025-03-15 00:20:54,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:20:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:20:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1512 transitions. [2025-03-15 00:20:54,177 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7346938775510204 [2025-03-15 00:20:54,177 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 14 predicate places. [2025-03-15 00:20:54,177 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 1149 transitions, 16383 flow [2025-03-15 00:20:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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-15 00:20:54,178 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:20:54,178 INFO L221 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] [2025-03-15 00:20:54,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:20:54,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:20:54,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:20:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1264409207, now seen corresponding path program 1 times [2025-03-15 00:20:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:20:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159759412] [2025-03-15 00:20:54,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:20:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:20:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:20:54,410 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-15 00:20:54,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:20:54,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159759412] [2025-03-15 00:20:54,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159759412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:20:54,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:20:54,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:20:54,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706541063] [2025-03-15 00:20:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:20:54,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:20:54,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:20:54,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:20:54,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:20:54,413 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 343 [2025-03-15 00:20:54,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1149 transitions, 16383 flow. Second operand has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 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-15 00:20:54,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:20:54,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 343 [2025-03-15 00:20:54,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:21:18,587 INFO L124 PetriNetUnfolderBase]: 74615/133363 cut-off events. [2025-03-15 00:21:18,588 INFO L125 PetriNetUnfolderBase]: For 398422/439724 co-relation queries the response was YES. [2025-03-15 00:21:19,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941811 conditions, 133363 events. 74615/133363 cut-off events. For 398422/439724 co-relation queries the response was YES. Maximal size of possible extension queue 2024. Compared 1293794 event pairs, 28235 based on Foata normal form. 76/119406 useless extension candidates. Maximal degree in co-relation 939910. Up to 96969 conditions per place. [2025-03-15 00:21:20,205 INFO L140 encePairwiseOnDemand]: 320/343 looper letters, 1234 selfloop transitions, 218 changer transitions 13/1655 dead transitions. [2025-03-15 00:21:20,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 1655 transitions, 27719 flow [2025-03-15 00:21:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:21:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:21:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1588 transitions. [2025-03-15 00:21:20,208 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.771622934888241 [2025-03-15 00:21:20,210 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 19 predicate places. [2025-03-15 00:21:20,210 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 1655 transitions, 27719 flow [2025-03-15 00:21:20,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 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-15 00:21:20,210 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:21:20,210 INFO L221 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] [2025-03-15 00:21:20,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:21:20,210 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:21:20,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:21:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2104406561, now seen corresponding path program 1 times [2025-03-15 00:21:20,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:21:20,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158173702] [2025-03-15 00:21:20,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:21:20,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:21:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:21:20,434 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-15 00:21:20,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:21:20,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158173702] [2025-03-15 00:21:20,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158173702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:21:20,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:21:20,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:21:20,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727673707] [2025-03-15 00:21:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:21:20,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:21:20,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:21:20,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:21:20,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:21:20,436 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 343 [2025-03-15 00:21:20,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 1655 transitions, 27719 flow. Second operand has 6 states, 6 states have (on average 213.83333333333334) internal successors, (1283), 6 states have internal predecessors, (1283), 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-15 00:21:20,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:21:20,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 343 [2025-03-15 00:21:20,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:21:58,685 INFO L124 PetriNetUnfolderBase]: 92510/173088 cut-off events. [2025-03-15 00:21:58,685 INFO L125 PetriNetUnfolderBase]: For 559046/635463 co-relation queries the response was YES. [2025-03-15 00:21:59,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302257 conditions, 173088 events. 92510/173088 cut-off events. For 559046/635463 co-relation queries the response was YES. Maximal size of possible extension queue 2448. Compared 1819903 event pairs, 22856 based on Foata normal form. 113/154741 useless extension candidates. Maximal degree in co-relation 1300217. Up to 121940 conditions per place. [2025-03-15 00:22:00,843 INFO L140 encePairwiseOnDemand]: 314/343 looper letters, 1874 selfloop transitions, 297 changer transitions 13/2366 dead transitions. [2025-03-15 00:22:00,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 2366 transitions, 45183 flow [2025-03-15 00:22:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:22:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:22:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1532 transitions. [2025-03-15 00:22:00,846 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7444120505344995 [2025-03-15 00:22:00,847 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 23 predicate places. [2025-03-15 00:22:00,847 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 2366 transitions, 45183 flow [2025-03-15 00:22:00,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.83333333333334) internal successors, (1283), 6 states have internal predecessors, (1283), 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-15 00:22:00,847 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:22:00,848 INFO L221 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] [2025-03-15 00:22:00,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:22:00,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:22:00,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:22:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1872795135, now seen corresponding path program 1 times [2025-03-15 00:22:00,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:22:00,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670531046] [2025-03-15 00:22:00,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:22:00,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:22:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:22:01,095 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-15 00:22:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:22:01,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670531046] [2025-03-15 00:22:01,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670531046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:22:01,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:22:01,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:22:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242134758] [2025-03-15 00:22:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:22:01,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:22:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:22:01,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:22:01,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:22:01,097 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 343 [2025-03-15 00:22:01,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 2366 transitions, 45183 flow. Second operand has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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-15 00:22:01,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:22:01,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 343 [2025-03-15 00:22:01,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:23:13,357 INFO L124 PetriNetUnfolderBase]: 130590/242025 cut-off events. [2025-03-15 00:23:13,357 INFO L125 PetriNetUnfolderBase]: For 1226274/1291984 co-relation queries the response was YES. [2025-03-15 00:23:14,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897279 conditions, 242025 events. 130590/242025 cut-off events. For 1226274/1291984 co-relation queries the response was YES. Maximal size of possible extension queue 3065. Compared 2585225 event pairs, 33277 based on Foata normal form. 58/218259 useless extension candidates. Maximal degree in co-relation 1894651. Up to 161239 conditions per place. [2025-03-15 00:23:16,730 INFO L140 encePairwiseOnDemand]: 308/343 looper letters, 2426 selfloop transitions, 900 changer transitions 13/3532 dead transitions. [2025-03-15 00:23:16,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 3532 transitions, 75569 flow [2025-03-15 00:23:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:23:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:23:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1576 transitions. [2025-03-15 00:23:16,732 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7657920310981535 [2025-03-15 00:23:16,733 INFO L298 CegarLoopForPetriNet]: 335 programPoint places, 28 predicate places. [2025-03-15 00:23:16,733 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 3532 transitions, 75569 flow [2025-03-15 00:23:16,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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-15 00:23:16,733 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:23:16,733 INFO L221 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-15 00:23:16,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:23:16,733 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:23:16,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:23:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1011161019, now seen corresponding path program 1 times [2025-03-15 00:23:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:23:16,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465760427] [2025-03-15 00:23:16,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:23:16,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:23:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:23:16,954 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-15 00:23:16,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:23:16,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465760427] [2025-03-15 00:23:16,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465760427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:23:16,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:23:16,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:23:16,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806744396] [2025-03-15 00:23:16,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:23:16,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:23:16,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:23:16,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:23:16,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:23:16,956 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 343 [2025-03-15 00:23:16,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 3532 transitions, 75569 flow. Second operand has 6 states, 6 states have (on average 221.16666666666666) internal successors, (1327), 6 states have internal predecessors, (1327), 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-15 00:23:16,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:23:16,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 343 [2025-03-15 00:23:16,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand