/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/weaver/parallel-parallel-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:59:57,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:59:57,280 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:59:57,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:59:57,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:59:57,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:59:57,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:59:57,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:59:57,305 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:59:57,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:59:57,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:59:57,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:59:57,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:59:57,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:59:57,308 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:59:57,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:59:57,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:57,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:59:57,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:59:57,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:59:57,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:59:57,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:59:57,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:59:57,308 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:59:57,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:59:57,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:59:57,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:59:57,578 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:59:57,578 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:59:57,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2025-03-15 00:59:58,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a82ef62/07d6cc322c19446e8e092b8f26f841d9/FLAG2df67ad04 [2025-03-15 00:59:58,920 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:59:58,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2025-03-15 00:59:58,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a82ef62/07d6cc322c19446e8e092b8f26f841d9/FLAG2df67ad04 [2025-03-15 00:59:59,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17a82ef62/07d6cc322c19446e8e092b8f26f841d9 [2025-03-15 00:59:59,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:59:59,323 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:59:59,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:59,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:59:59,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:59:59,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409279eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59, skipping insertion in model container [2025-03-15 00:59:59,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:59:59,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:59,493 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:59:59,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:59,543 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:59:59,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59 WrapperNode [2025-03-15 00:59:59,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:59,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:59,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:59:59,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:59:59,550 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:59:59" (1/1) ... [2025-03-15 00:59:59,564 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:59:59" (1/1) ... [2025-03-15 00:59:59,605 INFO L138 Inliner]: procedures = 28, calls = 59, calls flagged for inlining = 23, calls inlined = 33, statements flattened = 629 [2025-03-15 00:59:59,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:59,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:59:59,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:59:59,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:59:59,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:59:59,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:59:59,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:59:59,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:59:59,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (1/1) ... [2025-03-15 00:59:59,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:59,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:59:59,698 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:59:59,701 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:59:59,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:59:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:59:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:59:59,716 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:59:59,716 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:59:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 00:59:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 00:59:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-15 00:59:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-15 00:59:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:59:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:59:59,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:59:59,720 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:59:59,827 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:59:59,828 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:00:00,513 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:00:00,513 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:00:00,888 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:00:00,888 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-15 01:00:00,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:00:00 BoogieIcfgContainer [2025-03-15 01:00:00,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:00:00,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:00:00,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:00:00,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:00:00,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:59:59" (1/3) ... [2025-03-15 01:00:00,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b171a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:00:00, skipping insertion in model container [2025-03-15 01:00:00,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:59" (2/3) ... [2025-03-15 01:00:00,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b171a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:00:00, skipping insertion in model container [2025-03-15 01:00:00,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:00:00" (3/3) ... [2025-03-15 01:00:00,896 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2025-03-15 01:00:00,907 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:00:00,909 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-2.wvr.c that has 7 procedures, 453 locations, 1 initial locations, 5 loop locations, and 83 error locations. [2025-03-15 01:00:00,909 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:00:01,024 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-15 01:00:01,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:00:01,073 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;@250d189a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:00:01,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-03-15 01:00:01,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:00:01,095 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-03-15 01:00:01,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:00:01,097 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:01,098 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] [2025-03-15 01:00:01,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:01,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 394511395, now seen corresponding path program 1 times [2025-03-15 01:00:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:01,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173743092] [2025-03-15 01:00:01,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:01,261 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 01:00:01,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:01,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173743092] [2025-03-15 01:00:01,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173743092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:01,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:01,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000843431] [2025-03-15 01:00:01,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:01,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:01,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:01,293 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 525 [2025-03-15 01:00:01,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 521 transitions, 1108 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 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 01:00:01,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:01,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 525 [2025-03-15 01:00:01,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:02,363 INFO L124 PetriNetUnfolderBase]: 1436/4143 cut-off events. [2025-03-15 01:00:02,364 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2025-03-15 01:00:02,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6955 conditions, 4143 events. 1436/4143 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 30771 event pairs, 619 based on Foata normal form. 637/3978 useless extension candidates. Maximal degree in co-relation 6487. Up to 1830 conditions per place. [2025-03-15 01:00:02,424 INFO L140 encePairwiseOnDemand]: 460/525 looper letters, 35 selfloop transitions, 2 changer transitions 13/402 dead transitions. [2025-03-15 01:00:02,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 402 transitions, 926 flow [2025-03-15 01:00:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1309 transitions. [2025-03-15 01:00:02,440 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8311111111111111 [2025-03-15 01:00:02,445 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -104 predicate places. [2025-03-15 01:00:02,445 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 402 transitions, 926 flow [2025-03-15 01:00:02,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 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 01:00:02,447 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:02,447 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] [2025-03-15 01:00:02,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:00:02,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:02,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1699379543, now seen corresponding path program 1 times [2025-03-15 01:00:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011899054] [2025-03-15 01:00:02,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:02,509 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 01:00:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:02,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011899054] [2025-03-15 01:00:02,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011899054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:02,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:02,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565576289] [2025-03-15 01:00:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:02,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:02,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:02,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:02,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:02,514 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 525 [2025-03-15 01:00:02,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 402 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 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 01:00:02,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:02,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 525 [2025-03-15 01:00:02,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:03,246 INFO L124 PetriNetUnfolderBase]: 1575/4409 cut-off events. [2025-03-15 01:00:03,247 INFO L125 PetriNetUnfolderBase]: For 2352/2712 co-relation queries the response was YES. [2025-03-15 01:00:03,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9411 conditions, 4409 events. 1575/4409 cut-off events. For 2352/2712 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 32896 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 8840. Up to 1972 conditions per place. [2025-03-15 01:00:03,298 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 35 selfloop transitions, 2 changer transitions 13/401 dead transitions. [2025-03-15 01:00:03,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 401 transitions, 998 flow [2025-03-15 01:00:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1247 transitions. [2025-03-15 01:00:03,302 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7917460317460318 [2025-03-15 01:00:03,302 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -103 predicate places. [2025-03-15 01:00:03,302 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 401 transitions, 998 flow [2025-03-15 01:00:03,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 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 01:00:03,303 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:03,303 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] [2025-03-15 01:00:03,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:00:03,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:03,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:03,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1658639311, now seen corresponding path program 1 times [2025-03-15 01:00:03,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:03,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123305601] [2025-03-15 01:00:03,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:03,361 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 01:00:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:03,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123305601] [2025-03-15 01:00:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123305601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:03,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:03,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452541842] [2025-03-15 01:00:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:03,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:03,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:03,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:03,363 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-15 01:00:03,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 401 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:03,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:03,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-15 01:00:03,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:04,147 INFO L124 PetriNetUnfolderBase]: 1575/4408 cut-off events. [2025-03-15 01:00:04,147 INFO L125 PetriNetUnfolderBase]: For 4107/4815 co-relation queries the response was YES. [2025-03-15 01:00:04,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11325 conditions, 4408 events. 1575/4408 cut-off events. For 4107/4815 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 32858 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 10681. Up to 1972 conditions per place. [2025-03-15 01:00:04,186 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 13/400 dead transitions. [2025-03-15 01:00:04,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 400 transitions, 1058 flow [2025-03-15 01:00:04,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-15 01:00:04,190 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-15 01:00:04,190 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -102 predicate places. [2025-03-15 01:00:04,191 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 400 transitions, 1058 flow [2025-03-15 01:00:04,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:04,191 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:04,191 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] [2025-03-15 01:00:04,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:00:04,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:04,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash -766234499, now seen corresponding path program 1 times [2025-03-15 01:00:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:04,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260397655] [2025-03-15 01:00:04,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:04,255 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 01:00:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260397655] [2025-03-15 01:00:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260397655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:04,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:04,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653377883] [2025-03-15 01:00:04,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:04,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:04,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:04,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:04,257 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-15 01:00:04,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 400 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:04,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:04,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-15 01:00:04,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:05,044 INFO L124 PetriNetUnfolderBase]: 1575/4407 cut-off events. [2025-03-15 01:00:05,045 INFO L125 PetriNetUnfolderBase]: For 6451/7489 co-relation queries the response was YES. [2025-03-15 01:00:05,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13239 conditions, 4407 events. 1575/4407 cut-off events. For 6451/7489 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 32882 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 12522. Up to 1972 conditions per place. [2025-03-15 01:00:05,079 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 13/399 dead transitions. [2025-03-15 01:00:05,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 399 transitions, 1118 flow [2025-03-15 01:00:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-15 01:00:05,082 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-15 01:00:05,083 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -101 predicate places. [2025-03-15 01:00:05,083 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 399 transitions, 1118 flow [2025-03-15 01:00:05,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:05,084 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:05,084 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] [2025-03-15 01:00:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:00:05,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1025072663, now seen corresponding path program 1 times [2025-03-15 01:00:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032195247] [2025-03-15 01:00:05,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:05,138 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 01:00:05,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032195247] [2025-03-15 01:00:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032195247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:05,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:05,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:05,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313231398] [2025-03-15 01:00:05,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:05,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:05,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:05,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:05,140 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-15 01:00:05,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 399 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:05,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:05,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-15 01:00:05,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:05,808 INFO L124 PetriNetUnfolderBase]: 1575/4406 cut-off events. [2025-03-15 01:00:05,808 INFO L125 PetriNetUnfolderBase]: For 9384/10752 co-relation queries the response was YES. [2025-03-15 01:00:05,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15153 conditions, 4406 events. 1575/4406 cut-off events. For 9384/10752 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32884 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 14363. Up to 1972 conditions per place. [2025-03-15 01:00:05,843 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 13/398 dead transitions. [2025-03-15 01:00:05,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 398 transitions, 1178 flow [2025-03-15 01:00:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-15 01:00:05,846 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-15 01:00:05,846 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -100 predicate places. [2025-03-15 01:00:05,846 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 398 transitions, 1178 flow [2025-03-15 01:00:05,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:05,847 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:05,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:00:05,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:05,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash 856437038, now seen corresponding path program 1 times [2025-03-15 01:00:05,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:05,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661633626] [2025-03-15 01:00:05,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:05,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:05,879 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 01:00:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661633626] [2025-03-15 01:00:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661633626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:05,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:05,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069603014] [2025-03-15 01:00:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:05,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:05,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:05,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:05,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:05,881 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-15 01:00:05,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 398 transitions, 1178 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:05,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:05,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-15 01:00:05,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:06,514 INFO L124 PetriNetUnfolderBase]: 1575/4405 cut-off events. [2025-03-15 01:00:06,514 INFO L125 PetriNetUnfolderBase]: For 12906/14604 co-relation queries the response was YES. [2025-03-15 01:00:06,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17067 conditions, 4405 events. 1575/4405 cut-off events. For 12906/14604 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32844 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 16204. Up to 1972 conditions per place. [2025-03-15 01:00:06,563 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 13/397 dead transitions. [2025-03-15 01:00:06,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 397 transitions, 1238 flow [2025-03-15 01:00:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-15 01:00:06,566 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-15 01:00:06,568 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -99 predicate places. [2025-03-15 01:00:06,569 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 397 transitions, 1238 flow [2025-03-15 01:00:06,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:06,570 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:06,570 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 01:00:06,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:00:06,570 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:06,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1041907292, now seen corresponding path program 1 times [2025-03-15 01:00:06,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183276667] [2025-03-15 01:00:06,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:06,621 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 01:00:06,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183276667] [2025-03-15 01:00:06,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183276667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:06,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:06,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:06,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434792082] [2025-03-15 01:00:06,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:06,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:06,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:06,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:06,624 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 525 [2025-03-15 01:00:06,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 397 transitions, 1238 flow. Second operand has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 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 01:00:06,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:06,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 525 [2025-03-15 01:00:06,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:07,454 INFO L124 PetriNetUnfolderBase]: 1575/4404 cut-off events. [2025-03-15 01:00:07,454 INFO L125 PetriNetUnfolderBase]: For 17017/19045 co-relation queries the response was YES. [2025-03-15 01:00:07,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18999 conditions, 4404 events. 1575/4404 cut-off events. For 17017/19045 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32877 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 18045. Up to 1972 conditions per place. [2025-03-15 01:00:07,506 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 47 selfloop transitions, 2 changer transitions 13/396 dead transitions. [2025-03-15 01:00:07,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 396 transitions, 1334 flow [2025-03-15 01:00:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions. [2025-03-15 01:00:07,513 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7822222222222223 [2025-03-15 01:00:07,514 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -98 predicate places. [2025-03-15 01:00:07,515 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 396 transitions, 1334 flow [2025-03-15 01:00:07,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 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 01:00:07,515 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:07,516 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 01:00:07,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:00:07,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:07,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash 884521900, now seen corresponding path program 1 times [2025-03-15 01:00:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:07,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502573749] [2025-03-15 01:00:07,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:07,559 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 01:00:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:07,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502573749] [2025-03-15 01:00:07,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502573749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:07,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:07,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866292260] [2025-03-15 01:00:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:07,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:07,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:07,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:07,561 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-03-15 01:00:07,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 396 transitions, 1334 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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 01:00:07,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:07,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-03-15 01:00:07,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:08,125 INFO L124 PetriNetUnfolderBase]: 1575/4403 cut-off events. [2025-03-15 01:00:08,126 INFO L125 PetriNetUnfolderBase]: For 21717/24075 co-relation queries the response was YES. [2025-03-15 01:00:08,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20916 conditions, 4403 events. 1575/4403 cut-off events. For 21717/24075 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32940 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 19886. Up to 1972 conditions per place. [2025-03-15 01:00:08,169 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 32 selfloop transitions, 2 changer transitions 13/395 dead transitions. [2025-03-15 01:00:08,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 395 transitions, 1400 flow [2025-03-15 01:00:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-15 01:00:08,171 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8012698412698412 [2025-03-15 01:00:08,172 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -97 predicate places. [2025-03-15 01:00:08,172 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 395 transitions, 1400 flow [2025-03-15 01:00:08,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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 01:00:08,172 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:08,172 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] [2025-03-15 01:00:08,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:00:08,173 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:08,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1427229527, now seen corresponding path program 1 times [2025-03-15 01:00:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:08,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623062701] [2025-03-15 01:00:08,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:08,212 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 01:00:08,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:08,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623062701] [2025-03-15 01:00:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623062701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:08,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:08,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:08,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186416294] [2025-03-15 01:00:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:08,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:08,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:08,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:08,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:08,215 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-03-15 01:00:08,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 395 transitions, 1400 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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 01:00:08,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:08,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-03-15 01:00:08,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:08,770 INFO L124 PetriNetUnfolderBase]: 1575/4402 cut-off events. [2025-03-15 01:00:08,771 INFO L125 PetriNetUnfolderBase]: For 27006/29694 co-relation queries the response was YES. [2025-03-15 01:00:08,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22833 conditions, 4402 events. 1575/4402 cut-off events. For 27006/29694 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32959 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 21727. Up to 1972 conditions per place. [2025-03-15 01:00:08,815 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 32 selfloop transitions, 2 changer transitions 13/394 dead transitions. [2025-03-15 01:00:08,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 394 transitions, 1466 flow [2025-03-15 01:00:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-15 01:00:08,817 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8012698412698412 [2025-03-15 01:00:08,818 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -96 predicate places. [2025-03-15 01:00:08,818 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 394 transitions, 1466 flow [2025-03-15 01:00:08,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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 01:00:08,819 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:08,819 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] [2025-03-15 01:00:08,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:00:08,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:08,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash 334635798, now seen corresponding path program 1 times [2025-03-15 01:00:08,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:08,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921264369] [2025-03-15 01:00:08,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:08,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:08,855 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 01:00:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921264369] [2025-03-15 01:00:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921264369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:08,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:08,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394621067] [2025-03-15 01:00:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:08,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:08,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:08,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:08,857 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-03-15 01:00:08,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 394 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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 01:00:08,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:08,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-03-15 01:00:08,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:09,495 INFO L124 PetriNetUnfolderBase]: 1575/4401 cut-off events. [2025-03-15 01:00:09,495 INFO L125 PetriNetUnfolderBase]: For 32884/35902 co-relation queries the response was YES. [2025-03-15 01:00:09,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24750 conditions, 4401 events. 1575/4401 cut-off events. For 32884/35902 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32885 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 23568. Up to 1972 conditions per place. [2025-03-15 01:00:09,544 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 32 selfloop transitions, 2 changer transitions 13/393 dead transitions. [2025-03-15 01:00:09,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 393 transitions, 1532 flow [2025-03-15 01:00:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-15 01:00:09,547 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8012698412698412 [2025-03-15 01:00:09,548 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -95 predicate places. [2025-03-15 01:00:09,548 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 393 transitions, 1532 flow [2025-03-15 01:00:09,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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 01:00:09,549 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:09,549 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 01:00:09,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:00:09,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:09,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1059687974, now seen corresponding path program 1 times [2025-03-15 01:00:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405864588] [2025-03-15 01:00:09,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:09,587 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 01:00:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405864588] [2025-03-15 01:00:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405864588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:09,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:09,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:09,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344707186] [2025-03-15 01:00:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:09,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:09,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:09,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:09,593 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-03-15 01:00:09,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 393 transitions, 1532 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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 01:00:09,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:09,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-03-15 01:00:09,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:10,361 INFO L124 PetriNetUnfolderBase]: 1575/4400 cut-off events. [2025-03-15 01:00:10,361 INFO L125 PetriNetUnfolderBase]: For 39351/42699 co-relation queries the response was YES. [2025-03-15 01:00:10,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26667 conditions, 4400 events. 1575/4400 cut-off events. For 39351/42699 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32882 event pairs, 699 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 25409. Up to 1972 conditions per place. [2025-03-15 01:00:10,414 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 31 selfloop transitions, 2 changer transitions 13/392 dead transitions. [2025-03-15 01:00:10,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 392 transitions, 1598 flow [2025-03-15 01:00:10,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-15 01:00:10,417 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8012698412698412 [2025-03-15 01:00:10,418 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -94 predicate places. [2025-03-15 01:00:10,418 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 392 transitions, 1598 flow [2025-03-15 01:00:10,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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 01:00:10,419 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:10,419 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:10,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:00:10,419 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:10,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 499152047, now seen corresponding path program 1 times [2025-03-15 01:00:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:10,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931646351] [2025-03-15 01:00:10,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:10,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:10,461 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 01:00:10,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:10,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931646351] [2025-03-15 01:00:10,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931646351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:10,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:10,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:10,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958583419] [2025-03-15 01:00:10,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:10,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:10,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:10,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:10,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:10,463 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 525 [2025-03-15 01:00:10,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 392 transitions, 1598 flow. Second operand has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 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 01:00:10,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:10,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 525 [2025-03-15 01:00:10,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:11,126 INFO L124 PetriNetUnfolderBase]: 1860/4714 cut-off events. [2025-03-15 01:00:11,126 INFO L125 PetriNetUnfolderBase]: For 63054/67198 co-relation queries the response was YES. [2025-03-15 01:00:11,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32499 conditions, 4714 events. 1860/4714 cut-off events. For 63054/67198 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 34615 event pairs, 864 based on Foata normal form. 0/3708 useless extension candidates. Maximal degree in co-relation 31117. Up to 2327 conditions per place. [2025-03-15 01:00:11,218 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 41 selfloop transitions, 2 changer transitions 13/391 dead transitions. [2025-03-15 01:00:11,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 391 transitions, 1682 flow [2025-03-15 01:00:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1226 transitions. [2025-03-15 01:00:11,222 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7784126984126984 [2025-03-15 01:00:11,224 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -93 predicate places. [2025-03-15 01:00:11,224 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 391 transitions, 1682 flow [2025-03-15 01:00:11,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 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 01:00:11,225 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:11,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:11,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:00:11,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:11,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1393051057, now seen corresponding path program 1 times [2025-03-15 01:00:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703869903] [2025-03-15 01:00:11,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:11,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:11,271 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 01:00:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:11,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703869903] [2025-03-15 01:00:11,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703869903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:11,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:11,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:11,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464762168] [2025-03-15 01:00:11,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:11,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:11,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:11,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:11,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:11,273 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 525 [2025-03-15 01:00:11,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 391 transitions, 1682 flow. Second operand has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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 01:00:11,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:11,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 525 [2025-03-15 01:00:11,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:12,175 INFO L124 PetriNetUnfolderBase]: 1763/4565 cut-off events. [2025-03-15 01:00:12,175 INFO L125 PetriNetUnfolderBase]: For 65801/70322 co-relation queries the response was YES. [2025-03-15 01:00:12,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33329 conditions, 4565 events. 1763/4565 cut-off events. For 65801/70322 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 33520 event pairs, 807 based on Foata normal form. 0/3640 useless extension candidates. Maximal degree in co-relation 31888. Up to 2185 conditions per place. [2025-03-15 01:00:12,260 INFO L140 encePairwiseOnDemand]: 520/525 looper letters, 35 selfloop transitions, 1 changer transitions 13/387 dead transitions. [2025-03-15 01:00:12,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 387 transitions, 1738 flow [2025-03-15 01:00:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2025-03-15 01:00:12,263 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7834920634920635 [2025-03-15 01:00:12,264 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -95 predicate places. [2025-03-15 01:00:12,264 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 387 transitions, 1738 flow [2025-03-15 01:00:12,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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 01:00:12,264 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:12,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:12,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:00:12,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:12,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1355384984, now seen corresponding path program 1 times [2025-03-15 01:00:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937483700] [2025-03-15 01:00:12,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:12,930 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 01:00:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937483700] [2025-03-15 01:00:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937483700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:00:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369467936] [2025-03-15 01:00:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:12,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:00:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:12,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:00:12,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:00:12,934 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 525 [2025-03-15 01:00:12,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 387 transitions, 1738 flow. Second operand has 6 states, 6 states have (on average 401.8333333333333) internal successors, (2411), 6 states have internal predecessors, (2411), 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 01:00:12,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:12,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 525 [2025-03-15 01:00:12,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:13,912 INFO L124 PetriNetUnfolderBase]: 1763/4564 cut-off events. [2025-03-15 01:00:13,913 INFO L125 PetriNetUnfolderBase]: For 76246/81111 co-relation queries the response was YES. [2025-03-15 01:00:13,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35440 conditions, 4564 events. 1763/4564 cut-off events. For 76246/81111 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 33593 event pairs, 807 based on Foata normal form. 0/3640 useless extension candidates. Maximal degree in co-relation 33911. Up to 2185 conditions per place. [2025-03-15 01:00:14,052 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 39 selfloop transitions, 5 changer transitions 13/386 dead transitions. [2025-03-15 01:00:14,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 386 transitions, 1824 flow [2025-03-15 01:00:14,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:00:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:00:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2445 transitions. [2025-03-15 01:00:14,055 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7761904761904762 [2025-03-15 01:00:14,056 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -91 predicate places. [2025-03-15 01:00:14,056 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 386 transitions, 1824 flow [2025-03-15 01:00:14,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 401.8333333333333) internal successors, (2411), 6 states have internal predecessors, (2411), 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 01:00:14,057 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:14,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:14,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:00:14,058 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:14,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash -454445634, now seen corresponding path program 1 times [2025-03-15 01:00:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:14,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122328558] [2025-03-15 01:00:14,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:14,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:14,097 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 01:00:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122328558] [2025-03-15 01:00:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122328558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:14,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:14,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755262312] [2025-03-15 01:00:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:14,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:14,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:14,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:14,098 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-15 01:00:14,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 386 transitions, 1824 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:14,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:14,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-15 01:00:14,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:14,715 INFO L124 PetriNetUnfolderBase]: 1763/4563 cut-off events. [2025-03-15 01:00:14,715 INFO L125 PetriNetUnfolderBase]: For 87396/92591 co-relation queries the response was YES. [2025-03-15 01:00:14,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37538 conditions, 4563 events. 1763/4563 cut-off events. For 87396/92591 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 33516 event pairs, 807 based on Foata normal form. 0/3640 useless extension candidates. Maximal degree in co-relation 35934. Up to 2185 conditions per place. [2025-03-15 01:00:14,794 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 13/385 dead transitions. [2025-03-15 01:00:14,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 385 transitions, 1884 flow [2025-03-15 01:00:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-15 01:00:14,796 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-15 01:00:14,796 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -90 predicate places. [2025-03-15 01:00:14,796 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 385 transitions, 1884 flow [2025-03-15 01:00:14,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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 01:00:14,797 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:14,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:14,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:00:14,797 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:14,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1280189220, now seen corresponding path program 1 times [2025-03-15 01:00:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:14,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137052542] [2025-03-15 01:00:14,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:14,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:14,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137052542] [2025-03-15 01:00:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137052542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:14,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:14,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161351590] [2025-03-15 01:00:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:14,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:14,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:14,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:14,840 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 525 [2025-03-15 01:00:14,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 385 transitions, 1884 flow. Second operand has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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 01:00:14,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:14,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 525 [2025-03-15 01:00:14,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:15,927 INFO L124 PetriNetUnfolderBase]: 2599/6152 cut-off events. [2025-03-15 01:00:15,927 INFO L125 PetriNetUnfolderBase]: For 147453/156380 co-relation queries the response was YES. [2025-03-15 01:00:15,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57680 conditions, 6152 events. 2599/6152 cut-off events. For 147453/156380 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 47246 event pairs, 704 based on Foata normal form. 0/4999 useless extension candidates. Maximal degree in co-relation 56003. Up to 3232 conditions per place. [2025-03-15 01:00:16,023 INFO L140 encePairwiseOnDemand]: 516/525 looper letters, 59 selfloop transitions, 3 changer transitions 13/401 dead transitions. [2025-03-15 01:00:16,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 401 transitions, 2724 flow [2025-03-15 01:00:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-15 01:00:16,026 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8012698412698412 [2025-03-15 01:00:16,026 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -94 predicate places. [2025-03-15 01:00:16,026 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 401 transitions, 2724 flow [2025-03-15 01:00:16,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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 01:00:16,027 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:16,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:16,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:00:16,027 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:16,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:16,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1901252078, now seen corresponding path program 1 times [2025-03-15 01:00:16,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:16,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655381560] [2025-03-15 01:00:16,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:16,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:16,060 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 01:00:16,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:16,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655381560] [2025-03-15 01:00:16,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655381560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:16,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:16,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:16,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470780245] [2025-03-15 01:00:16,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:16,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:16,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:16,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:16,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:16,062 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 525 [2025-03-15 01:00:16,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 401 transitions, 2724 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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 01:00:16,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:16,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 525 [2025-03-15 01:00:16,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:17,495 INFO L124 PetriNetUnfolderBase]: 3697/8280 cut-off events. [2025-03-15 01:00:17,496 INFO L125 PetriNetUnfolderBase]: For 241622/251914 co-relation queries the response was YES. [2025-03-15 01:00:17,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85077 conditions, 8280 events. 3697/8280 cut-off events. For 241622/251914 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 66351 event pairs, 640 based on Foata normal form. 0/6825 useless extension candidates. Maximal degree in co-relation 83327. Up to 4590 conditions per place. [2025-03-15 01:00:17,625 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 89 selfloop transitions, 5 changer transitions 13/442 dead transitions. [2025-03-15 01:00:17,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 442 transitions, 4402 flow [2025-03-15 01:00:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-03-15 01:00:17,627 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8196825396825397 [2025-03-15 01:00:17,627 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -93 predicate places. [2025-03-15 01:00:17,627 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 442 transitions, 4402 flow [2025-03-15 01:00:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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 01:00:17,628 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:17,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:17,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:00:17,628 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:17,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash 928575953, now seen corresponding path program 1 times [2025-03-15 01:00:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657936698] [2025-03-15 01:00:17,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:17,667 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 01:00:17,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:17,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657936698] [2025-03-15 01:00:17,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657936698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:17,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:17,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930564913] [2025-03-15 01:00:17,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:17,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:17,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:17,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:17,670 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 525 [2025-03-15 01:00:17,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 442 transitions, 4402 flow. Second operand has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 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 01:00:17,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:17,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 525 [2025-03-15 01:00:17,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:20,140 INFO L124 PetriNetUnfolderBase]: 6430/14276 cut-off events. [2025-03-15 01:00:20,140 INFO L125 PetriNetUnfolderBase]: For 467076/482572 co-relation queries the response was YES. [2025-03-15 01:00:20,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155303 conditions, 14276 events. 6430/14276 cut-off events. For 467076/482572 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 128056 event pairs, 1152 based on Foata normal form. 0/11807 useless extension candidates. Maximal degree in co-relation 87559. Up to 8001 conditions per place. [2025-03-15 01:00:20,667 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 172 selfloop transitions, 9 changer transitions 13/530 dead transitions. [2025-03-15 01:00:20,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 530 transitions, 8113 flow [2025-03-15 01:00:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-03-15 01:00:20,670 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2025-03-15 01:00:20,670 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -92 predicate places. [2025-03-15 01:00:20,671 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 530 transitions, 8113 flow [2025-03-15 01:00:20,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 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 01:00:20,671 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:20,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:20,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:00:20,671 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:20,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1170540717, now seen corresponding path program 1 times [2025-03-15 01:00:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:20,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874535259] [2025-03-15 01:00:20,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:20,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:20,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:20,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874535259] [2025-03-15 01:00:20,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874535259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:20,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:20,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98642847] [2025-03-15 01:00:20,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:20,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:20,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:20,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:20,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:20,720 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 525 [2025-03-15 01:00:20,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 530 transitions, 8113 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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 01:00:20,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:20,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 525 [2025-03-15 01:00:20,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:26,213 INFO L124 PetriNetUnfolderBase]: 11377/25159 cut-off events. [2025-03-15 01:00:26,213 INFO L125 PetriNetUnfolderBase]: For 924075/949001 co-relation queries the response was YES. [2025-03-15 01:00:26,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287942 conditions, 25159 events. 11377/25159 cut-off events. For 924075/949001 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 249748 event pairs, 2114 based on Foata normal form. 0/20871 useless extension candidates. Maximal degree in co-relation 91817. Up to 14189 conditions per place. [2025-03-15 01:00:26,978 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 344 selfloop transitions, 17 changer transitions 13/707 dead transitions. [2025-03-15 01:00:26,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 707 transitions, 15889 flow [2025-03-15 01:00:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-15 01:00:26,981 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-03-15 01:00:26,981 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -91 predicate places. [2025-03-15 01:00:26,981 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 707 transitions, 15889 flow [2025-03-15 01:00:26,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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 01:00:26,981 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:26,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:26,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:00:26,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:26,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash -463954134, now seen corresponding path program 1 times [2025-03-15 01:00:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:26,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101552455] [2025-03-15 01:00:26,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:27,034 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 01:00:27,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:27,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101552455] [2025-03-15 01:00:27,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101552455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:27,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:27,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:27,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688730919] [2025-03-15 01:00:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:27,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:27,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:27,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:27,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:27,036 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 525 [2025-03-15 01:00:27,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 707 transitions, 15889 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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 01:00:27,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:27,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 525 [2025-03-15 01:00:27,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:33,343 INFO L124 PetriNetUnfolderBase]: 12023/26428 cut-off events. [2025-03-15 01:00:33,344 INFO L125 PetriNetUnfolderBase]: For 953688/965030 co-relation queries the response was YES. [2025-03-15 01:00:33,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321035 conditions, 26428 events. 12023/26428 cut-off events. For 953688/965030 co-relation queries the response was YES. Maximal size of possible extension queue 930. Compared 260509 event pairs, 1402 based on Foata normal form. 0/22327 useless extension candidates. Maximal degree in co-relation 92271. Up to 15095 conditions per place. [2025-03-15 01:00:34,239 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 438 selfloop transitions, 10 changer transitions 13/790 dead transitions. [2025-03-15 01:00:34,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 790 transitions, 20309 flow [2025-03-15 01:00:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2025-03-15 01:00:34,241 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8107936507936508 [2025-03-15 01:00:34,241 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -91 predicate places. [2025-03-15 01:00:34,242 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 790 transitions, 20309 flow [2025-03-15 01:00:34,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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 01:00:34,242 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:34,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:34,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:00:34,242 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:34,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:34,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2141560466, now seen corresponding path program 1 times [2025-03-15 01:00:34,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:34,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125047601] [2025-03-15 01:00:34,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:34,282 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 01:00:34,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:34,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125047601] [2025-03-15 01:00:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125047601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:34,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:34,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:34,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9194260] [2025-03-15 01:00:34,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:34,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:34,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:34,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:34,285 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 525 [2025-03-15 01:00:34,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 790 transitions, 20309 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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 01:00:34,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:34,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 525 [2025-03-15 01:00:34,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:42,991 INFO L124 PetriNetUnfolderBase]: 15475/35542 cut-off events. [2025-03-15 01:00:42,991 INFO L125 PetriNetUnfolderBase]: For 1189258/1202744 co-relation queries the response was YES. [2025-03-15 01:00:43,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437437 conditions, 35542 events. 15475/35542 cut-off events. For 1189258/1202744 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 374783 event pairs, 845 based on Foata normal form. 0/30501 useless extension candidates. Maximal degree in co-relation 104713. Up to 19505 conditions per place. [2025-03-15 01:00:44,034 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 786 selfloop transitions, 42 changer transitions 13/1169 dead transitions. [2025-03-15 01:00:44,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1169 transitions, 38677 flow [2025-03-15 01:00:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1278 transitions. [2025-03-15 01:00:44,037 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8114285714285714 [2025-03-15 01:00:44,037 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -91 predicate places. [2025-03-15 01:00:44,037 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 1169 transitions, 38677 flow [2025-03-15 01:00:44,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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 01:00:44,037 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:44,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:44,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:00:44,038 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:44,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:44,039 INFO L85 PathProgramCache]: Analyzing trace with hash -432286266, now seen corresponding path program 1 times [2025-03-15 01:00:44,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:44,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204897789] [2025-03-15 01:00:44,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:44,093 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 01:00:44,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:44,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204897789] [2025-03-15 01:00:44,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204897789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:44,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:44,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637979416] [2025-03-15 01:00:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:44,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:44,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:44,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:44,096 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 525 [2025-03-15 01:00:44,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 1169 transitions, 38677 flow. Second operand has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 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 01:00:44,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:44,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 525 [2025-03-15 01:00:44,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:53,775 INFO L124 PetriNetUnfolderBase]: 15475/35541 cut-off events. [2025-03-15 01:00:53,775 INFO L125 PetriNetUnfolderBase]: For 1308055/1322265 co-relation queries the response was YES. [2025-03-15 01:00:54,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455833 conditions, 35541 events. 15475/35541 cut-off events. For 1308055/1322265 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 375264 event pairs, 845 based on Foata normal form. 0/30501 useless extension candidates. Maximal degree in co-relation 108975. Up to 19505 conditions per place. [2025-03-15 01:00:54,821 INFO L140 encePairwiseOnDemand]: 523/525 looper letters, 824 selfloop transitions, 1 changer transitions 13/1168 dead transitions. [2025-03-15 01:00:54,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 1168 transitions, 40323 flow [2025-03-15 01:00:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2025-03-15 01:00:54,823 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8063492063492064 [2025-03-15 01:00:54,823 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -90 predicate places. [2025-03-15 01:00:54,823 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 1168 transitions, 40323 flow [2025-03-15 01:00:54,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 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 01:00:54,824 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:54,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:54,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:00:54,824 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-15 01:00:54,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash -474227777, now seen corresponding path program 1 times [2025-03-15 01:00:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:54,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589295696] [2025-03-15 01:00:54,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:54,868 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 01:00:54,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:54,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589295696] [2025-03-15 01:00:54,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589295696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:54,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:54,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:54,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405242364] [2025-03-15 01:00:54,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:54,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:54,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:54,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:54,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:54,870 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 525 [2025-03-15 01:00:54,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 1168 transitions, 40323 flow. Second operand has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 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 01:00:54,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:54,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 525 [2025-03-15 01:00:54,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:04,600 INFO L124 PetriNetUnfolderBase]: 15475/35540 cut-off events. [2025-03-15 01:01:04,600 INFO L125 PetriNetUnfolderBase]: For 1432315/1447307 co-relation queries the response was YES. [2025-03-15 01:01:04,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474229 conditions, 35540 events. 15475/35540 cut-off events. For 1432315/1447307 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 375157 event pairs, 845 based on Foata normal form. 0/30501 useless extension candidates. Maximal degree in co-relation 113237. Up to 19505 conditions per place. [2025-03-15 01:01:04,984 INFO L140 encePairwiseOnDemand]: 523/525 looper letters, 0 selfloop transitions, 0 changer transitions 1167/1167 dead transitions. [2025-03-15 01:01:04,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 1167 transitions, 41969 flow [2025-03-15 01:01:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2025-03-15 01:01:04,986 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8063492063492064 [2025-03-15 01:01:04,986 INFO L298 CegarLoopForPetriNet]: 513 programPoint places, -89 predicate places. [2025-03-15 01:01:04,986 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 1167 transitions, 41969 flow [2025-03-15 01:01:04,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 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 01:01:05,001 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-parallel-sum-2.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:01:05,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (146 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (145 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (144 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (143 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (142 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (141 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (140 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (139 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (138 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (137 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (136 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (135 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (134 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (133 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (132 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (131 of 147 remaining) [2025-03-15 01:01:05,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (130 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (129 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (128 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (127 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (126 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (125 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (124 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (123 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (122 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (121 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (120 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (119 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (118 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (117 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (116 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (115 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (114 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (113 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (112 of 147 remaining) [2025-03-15 01:01:05,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (111 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (110 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (109 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (108 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (107 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (106 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (105 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (102 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (101 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (100 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (99 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (98 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (97 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (96 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (95 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (94 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (93 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (92 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (91 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (90 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (89 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (86 of 147 remaining) [2025-03-15 01:01:05,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (85 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (84 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (83 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (82 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (79 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (78 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (77 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (76 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (75 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (74 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (73 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (72 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (71 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (70 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (69 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (68 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (67 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (66 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (65 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (64 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (63 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (62 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (61 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (60 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (59 of 147 remaining) [2025-03-15 01:01:05,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (58 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (50 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (49 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (47 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (46 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (44 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (42 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (41 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (40 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 147 remaining) [2025-03-15 01:01:05,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (28 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (27 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (26 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (25 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (24 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (21 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (20 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (19 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (18 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (17 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (16 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (15 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (14 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (13 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (12 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (11 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (10 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (9 of 147 remaining) [2025-03-15 01:01:05,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (8 of 147 remaining) [2025-03-15 01:01:05,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (7 of 147 remaining) [2025-03-15 01:01:05,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (6 of 147 remaining) [2025-03-15 01:01:05,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (5 of 147 remaining) [2025-03-15 01:01:05,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (4 of 147 remaining) [2025-03-15 01:01:05,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (3 of 147 remaining) [2025-03-15 01:01:05,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (2 of 147 remaining) [2025-03-15 01:01:05,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (1 of 147 remaining) [2025-03-15 01:01:05,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (0 of 147 remaining) [2025-03-15 01:01:05,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 01:01:05,059 INFO L422 BasicCegarLoop]: Path program histogram: [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 01:01:05,064 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:01:05,064 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:01:05,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:01:05 BasicIcfg [2025-03-15 01:01:05,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:01:05,069 INFO L158 Benchmark]: Toolchain (without parser) took 65745.27ms. Allocated memory was 71.3MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 45.0MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. [2025-03-15 01:01:05,069 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:01:05,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.93ms. Allocated memory is still 71.3MB. Free memory was 44.8MB in the beginning and 30.6MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:01:05,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.30ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 26.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:01:05,069 INFO L158 Benchmark]: Boogie Preprocessor took 61.04ms. Allocated memory is still 71.3MB. Free memory was 26.9MB in the beginning and 23.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:01:05,069 INFO L158 Benchmark]: RCFGBuilder took 1220.78ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.8MB in the beginning and 41.6MB in the end (delta: -17.8MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. [2025-03-15 01:01:05,069 INFO L158 Benchmark]: TraceAbstraction took 64177.12ms. Allocated memory was 88.1MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 40.9MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 4.8GB. Max. memory is 8.0GB. [2025-03-15 01:01:05,070 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.93ms. Allocated memory is still 71.3MB. Free memory was 44.8MB in the beginning and 30.6MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.30ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 26.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.04ms. Allocated memory is still 71.3MB. Free memory was 26.9MB in the beginning and 23.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 1220.78ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.8MB in the beginning and 41.6MB in the end (delta: -17.8MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. * TraceAbstraction took 64177.12ms. Allocated memory was 88.1MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 40.9MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 4.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 625 locations, 147 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 64.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 62.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1478 IncrementalHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 157 mSDtfsCounter, 1478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41969occurred in iteration=23, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2944 NumberOfCodeBlocks, 2944 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2921 ConstructedInterpolants, 0 QuantifiedInterpolants, 3080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 83 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:01:05,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...