/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/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:59:08,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:59:08,718 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:08,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:59:08,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:59:08,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:59:08,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:59:08,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:59:08,744 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:59:08,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:59:08,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:59:08,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:59:08,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:08,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:59:08,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:59:08,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:59:08,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:59:08,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:59:08,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:59:08,746 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:09,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:59:09,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:59:09,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:59:09,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:59:09,038 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:59:09,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2025-03-15 00:59:10,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f0f2811/29772f4384a343799a9cfccc663deb5b/FLAGedb7596fa [2025-03-15 00:59:10,385 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:59:10,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2025-03-15 00:59:10,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f0f2811/29772f4384a343799a9cfccc663deb5b/FLAGedb7596fa [2025-03-15 00:59:10,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f0f2811/29772f4384a343799a9cfccc663deb5b [2025-03-15 00:59:10,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:59:10,414 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:59:10,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:10,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:59:10,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:59:10,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:10" (1/1) ... [2025-03-15 00:59:10,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a44b1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:10, skipping insertion in model container [2025-03-15 00:59:10,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:10" (1/1) ... [2025-03-15 00:59:10,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:59:10,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:10,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:59:10,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:10,632 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:59:10,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:10 WrapperNode [2025-03-15 00:59:10,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:10,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:10,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:59:10,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:59:10,638 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:10" (1/1) ... [2025-03-15 00:59:10,651 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:10" (1/1) ... [2025-03-15 00:59:10,674 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 321 [2025-03-15 00:59:10,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:10,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:59:10,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:59:10,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:59:10,681 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:10" (1/1) ... [2025-03-15 00:59:10,681 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:10" (1/1) ... [2025-03-15 00:59:10,685 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:10" (1/1) ... [2025-03-15 00:59:10,685 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:10" (1/1) ... [2025-03-15 00:59:10,700 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:10" (1/1) ... [2025-03-15 00:59:10,701 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:10" (1/1) ... [2025-03-15 00:59:10,704 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:10" (1/1) ... [2025-03-15 00:59:10,705 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:10" (1/1) ... [2025-03-15 00:59:10,706 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:10" (1/1) ... [2025-03-15 00:59:10,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:59:10,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:59:10,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:59:10,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:59:10,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:10" (1/1) ... [2025-03-15 00:59:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:10,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:59:10,741 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:10,744 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:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-15 00:59:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:59:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:59:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:59:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:59:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:59:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:59:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-15 00:59:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:59:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:59:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:59:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:59:10,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:59:10,767 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:10,866 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:59:10,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:59:11,550 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:59:11,551 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:59:11,571 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:59:11,571 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-15 00:59:11,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:11 BoogieIcfgContainer [2025-03-15 00:59:11,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:59:11,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:59:11,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:59:11,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:59:11,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:59:10" (1/3) ... [2025-03-15 00:59:11,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf9ca7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:11, skipping insertion in model container [2025-03-15 00:59:11,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:10" (2/3) ... [2025-03-15 00:59:11,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf9ca7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:11, skipping insertion in model container [2025-03-15 00:59:11,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:11" (3/3) ... [2025-03-15 00:59:11,580 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-03-15 00:59:11,590 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:59:11,591 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 505 locations, 1 initial locations, 7 loop locations, and 55 error locations. [2025-03-15 00:59:11,591 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:59:11,685 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:59:11,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:59:11,751 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;@5d429b79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:59:11,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-15 00:59:11,774 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:59:11,775 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-15 00:59:11,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:59:11,777 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:11,778 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] [2025-03-15 00:59:11,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:11,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:11,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1920756340, now seen corresponding path program 1 times [2025-03-15 00:59:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917137869] [2025-03-15 00:59:11,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:11,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:11,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917137869] [2025-03-15 00:59:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917137869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:11,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:11,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826069025] [2025-03-15 00:59:11,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:11,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:11,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:11,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:11,927 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 531 [2025-03-15 00:59:11,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 531 transitions, 1076 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:11,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:11,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 531 [2025-03-15 00:59:11,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:12,149 INFO L124 PetriNetUnfolderBase]: 20/568 cut-off events. [2025-03-15 00:59:12,150 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-15 00:59:12,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 568 events. 20/568 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1281 event pairs, 6 based on Foata normal form. 25/506 useless extension candidates. Maximal degree in co-relation 352. Up to 46 conditions per place. [2025-03-15 00:59:12,159 INFO L140 encePairwiseOnDemand]: 511/531 looper letters, 31 selfloop transitions, 2 changer transitions 23/505 dead transitions. [2025-03-15 00:59:12,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 505 transitions, 1088 flow [2025-03-15 00:59:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1488 transitions. [2025-03-15 00:59:12,172 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9340866290018832 [2025-03-15 00:59:12,174 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -8 predicate places. [2025-03-15 00:59:12,174 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 505 transitions, 1088 flow [2025-03-15 00:59:12,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,175 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,175 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] [2025-03-15 00:59:12,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:59:12,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:12,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1357185779, now seen corresponding path program 1 times [2025-03-15 00:59:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873957929] [2025-03-15 00:59:12,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873957929] [2025-03-15 00:59:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873957929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43037223] [2025-03-15 00:59:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,216 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 531 [2025-03-15 00:59:12,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 505 transitions, 1088 flow. Second operand has 3 states, 3 states have (on average 484.3333333333333) internal successors, (1453), 3 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 531 [2025-03-15 00:59:12,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:12,325 INFO L124 PetriNetUnfolderBase]: 18/556 cut-off events. [2025-03-15 00:59:12,325 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-15 00:59:12,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 556 events. 18/556 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1175 event pairs, 4 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 355. Up to 34 conditions per place. [2025-03-15 00:59:12,328 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 21 selfloop transitions, 1 changer transitions 23/497 dead transitions. [2025-03-15 00:59:12,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 497 transitions, 1100 flow [2025-03-15 00:59:12,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1479 transitions. [2025-03-15 00:59:12,331 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.928436911487759 [2025-03-15 00:59:12,331 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -14 predicate places. [2025-03-15 00:59:12,331 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 497 transitions, 1100 flow [2025-03-15 00:59:12,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 484.3333333333333) internal successors, (1453), 3 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,332 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,332 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:12,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:59:12,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:12,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash 749752478, now seen corresponding path program 1 times [2025-03-15 00:59:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128039317] [2025-03-15 00:59:12,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:12,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128039317] [2025-03-15 00:59:12,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128039317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826231746] [2025-03-15 00:59:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,379 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 531 [2025-03-15 00:59:12,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 497 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 531 [2025-03-15 00:59:12,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:12,485 INFO L124 PetriNetUnfolderBase]: 20/557 cut-off events. [2025-03-15 00:59:12,485 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-03-15 00:59:12,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 557 events. 20/557 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1226 event pairs, 7 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 381. Up to 46 conditions per place. [2025-03-15 00:59:12,489 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 34 selfloop transitions, 2 changer transitions 23/496 dead transitions. [2025-03-15 00:59:12,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 496 transitions, 1170 flow [2025-03-15 00:59:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2025-03-15 00:59:12,494 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9196484620213434 [2025-03-15 00:59:12,494 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -13 predicate places. [2025-03-15 00:59:12,494 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 496 transitions, 1170 flow [2025-03-15 00:59:12,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,495 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,495 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] [2025-03-15 00:59:12,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:59:12,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:12,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash -965521057, now seen corresponding path program 1 times [2025-03-15 00:59:12,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502150610] [2025-03-15 00:59:12,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:12,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502150610] [2025-03-15 00:59:12,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502150610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725924604] [2025-03-15 00:59:12,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,551 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 531 [2025-03-15 00:59:12,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 496 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 481.3333333333333) internal successors, (1444), 3 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 531 [2025-03-15 00:59:12,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:12,727 INFO L124 PetriNetUnfolderBase]: 19/546 cut-off events. [2025-03-15 00:59:12,727 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-03-15 00:59:12,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 546 events. 19/546 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1183 event pairs, 6 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 384. Up to 35 conditions per place. [2025-03-15 00:59:12,730 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 23 selfloop transitions, 1 changer transitions 23/487 dead transitions. [2025-03-15 00:59:12,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 487 transitions, 1182 flow [2025-03-15 00:59:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1473 transitions. [2025-03-15 00:59:12,734 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9246704331450094 [2025-03-15 00:59:12,734 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -20 predicate places. [2025-03-15 00:59:12,734 INFO L471 AbstractCegarLoop]: Abstraction has has 491 places, 487 transitions, 1182 flow [2025-03-15 00:59:12,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 481.3333333333333) internal successors, (1444), 3 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,736 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,736 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] [2025-03-15 00:59:12,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:59:12,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:12,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1540140318, now seen corresponding path program 1 times [2025-03-15 00:59:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115920433] [2025-03-15 00:59:12,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115920433] [2025-03-15 00:59:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115920433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028404383] [2025-03-15 00:59:12,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,808 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 531 [2025-03-15 00:59:12,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 487 transitions, 1182 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 531 [2025-03-15 00:59:12,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:12,905 INFO L124 PetriNetUnfolderBase]: 23/583 cut-off events. [2025-03-15 00:59:12,905 INFO L125 PetriNetUnfolderBase]: For 286/307 co-relation queries the response was YES. [2025-03-15 00:59:12,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 583 events. 23/583 cut-off events. For 286/307 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1427 event pairs, 9 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 398. Up to 38 conditions per place. [2025-03-15 00:59:12,907 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 16 selfloop transitions, 2 changer transitions 23/486 dead transitions. [2025-03-15 00:59:12,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 486 transitions, 1216 flow [2025-03-15 00:59:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1501 transitions. [2025-03-15 00:59:12,910 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9422473320778405 [2025-03-15 00:59:12,912 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -19 predicate places. [2025-03-15 00:59:12,912 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 486 transitions, 1216 flow [2025-03-15 00:59:12,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,913 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,916 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] [2025-03-15 00:59:12,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:59:12,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:12,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash -814636520, now seen corresponding path program 1 times [2025-03-15 00:59:12,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685405048] [2025-03-15 00:59:12,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685405048] [2025-03-15 00:59:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685405048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116427003] [2025-03-15 00:59:12,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,996 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 531 [2025-03-15 00:59:12,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 486 transitions, 1216 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:12,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 531 [2025-03-15 00:59:12,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:13,060 INFO L124 PetriNetUnfolderBase]: 22/578 cut-off events. [2025-03-15 00:59:13,060 INFO L125 PetriNetUnfolderBase]: For 367/409 co-relation queries the response was YES. [2025-03-15 00:59:13,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 578 events. 22/578 cut-off events. For 367/409 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1405 event pairs, 8 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 401. Up to 37 conditions per place. [2025-03-15 00:59:13,063 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 11 selfloop transitions, 1 changer transitions 23/483 dead transitions. [2025-03-15 00:59:13,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 483 transitions, 1228 flow [2025-03-15 00:59:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2025-03-15 00:59:13,066 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9472693032015066 [2025-03-15 00:59:13,066 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -20 predicate places. [2025-03-15 00:59:13,066 INFO L471 AbstractCegarLoop]: Abstraction has has 491 places, 483 transitions, 1228 flow [2025-03-15 00:59:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:13,067 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:13,067 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 00:59:13,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:59:13,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash 447007525, now seen corresponding path program 1 times [2025-03-15 00:59:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840002517] [2025-03-15 00:59:13,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:13,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:13,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:13,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840002517] [2025-03-15 00:59:13,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840002517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:13,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:13,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:13,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008664310] [2025-03-15 00:59:13,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:13,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:13,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:13,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:13,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:13,137 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-15 00:59:13,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 483 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:13,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:13,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-15 00:59:13,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:13,207 INFO L124 PetriNetUnfolderBase]: 25/580 cut-off events. [2025-03-15 00:59:13,207 INFO L125 PetriNetUnfolderBase]: For 691/778 co-relation queries the response was YES. [2025-03-15 00:59:13,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 580 events. 25/580 cut-off events. For 691/778 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1465 event pairs, 11 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 409. Up to 40 conditions per place. [2025-03-15 00:59:13,211 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 13 selfloop transitions, 2 changer transitions 23/482 dead transitions. [2025-03-15 00:59:13,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 482 transitions, 1256 flow [2025-03-15 00:59:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2025-03-15 00:59:13,214 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9460138104205901 [2025-03-15 00:59:13,215 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -19 predicate places. [2025-03-15 00:59:13,215 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 482 transitions, 1256 flow [2025-03-15 00:59:13,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:13,216 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:13,216 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 00:59:13,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:59:13,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:13,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash -290135800, now seen corresponding path program 1 times [2025-03-15 00:59:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125460542] [2025-03-15 00:59:13,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125460542] [2025-03-15 00:59:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125460542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:13,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:13,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:13,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109804434] [2025-03-15 00:59:13,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:13,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:59:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:13,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:59:13,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:59:13,750 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 531 [2025-03-15 00:59:13,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 482 transitions, 1256 flow. Second operand has 6 states, 6 states have (on average 400.8333333333333) internal successors, (2405), 6 states have internal predecessors, (2405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:13,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:13,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 531 [2025-03-15 00:59:13,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:14,184 INFO L124 PetriNetUnfolderBase]: 337/1560 cut-off events. [2025-03-15 00:59:14,184 INFO L125 PetriNetUnfolderBase]: For 6757/7587 co-relation queries the response was YES. [2025-03-15 00:59:14,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 1560 events. 337/1560 cut-off events. For 6757/7587 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8475 event pairs, 257 based on Foata normal form. 0/1343 useless extension candidates. Maximal degree in co-relation 2274. Up to 655 conditions per place. [2025-03-15 00:59:14,192 INFO L140 encePairwiseOnDemand]: 513/531 looper letters, 96 selfloop transitions, 15 changer transitions 23/479 dead transitions. [2025-03-15 00:59:14,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 479 transitions, 1474 flow [2025-03-15 00:59:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2509 transitions. [2025-03-15 00:59:14,197 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7875078468298807 [2025-03-15 00:59:14,197 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -17 predicate places. [2025-03-15 00:59:14,197 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 479 transitions, 1474 flow [2025-03-15 00:59:14,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.8333333333333) internal successors, (2405), 6 states have internal predecessors, (2405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:14,199 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:14,199 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] [2025-03-15 00:59:14,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:59:14,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:14,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1279131123, now seen corresponding path program 1 times [2025-03-15 00:59:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:14,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963369238] [2025-03-15 00:59:14,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:14,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:14,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963369238] [2025-03-15 00:59:14,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963369238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:14,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:14,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468870386] [2025-03-15 00:59:14,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:14,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:14,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:14,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:14,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:14,238 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-15 00:59:14,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 479 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:14,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:14,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-15 00:59:14,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:14,459 INFO L124 PetriNetUnfolderBase]: 368/1700 cut-off events. [2025-03-15 00:59:14,459 INFO L125 PetriNetUnfolderBase]: For 9566/10440 co-relation queries the response was YES. [2025-03-15 00:59:14,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3518 conditions, 1700 events. 368/1700 cut-off events. For 9566/10440 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9754 event pairs, 284 based on Foata normal form. 0/1458 useless extension candidates. Maximal degree in co-relation 2617. Up to 703 conditions per place. [2025-03-15 00:59:14,466 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 13 selfloop transitions, 2 changer transitions 23/478 dead transitions. [2025-03-15 00:59:14,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 478 transitions, 1502 flow [2025-03-15 00:59:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2025-03-15 00:59:14,470 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9460138104205901 [2025-03-15 00:59:14,470 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -16 predicate places. [2025-03-15 00:59:14,470 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 478 transitions, 1502 flow [2025-03-15 00:59:14,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:14,471 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:14,471 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] [2025-03-15 00:59:14,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:59:14,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:14,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1992722743, now seen corresponding path program 1 times [2025-03-15 00:59:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669854641] [2025-03-15 00:59:14,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:14,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669854641] [2025-03-15 00:59:14,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669854641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:14,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:14,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835583178] [2025-03-15 00:59:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:14,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:14,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:14,524 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 531 [2025-03-15 00:59:14,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 478 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:14,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:14,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 531 [2025-03-15 00:59:14,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:14,842 INFO L124 PetriNetUnfolderBase]: 374/1705 cut-off events. [2025-03-15 00:59:14,842 INFO L125 PetriNetUnfolderBase]: For 14438/15544 co-relation queries the response was YES. [2025-03-15 00:59:14,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 1705 events. 374/1705 cut-off events. For 14438/15544 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 9779 event pairs, 287 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 2795. Up to 709 conditions per place. [2025-03-15 00:59:14,852 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 16 selfloop transitions, 2 changer transitions 23/477 dead transitions. [2025-03-15 00:59:14,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 477 transitions, 1536 flow [2025-03-15 00:59:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1501 transitions. [2025-03-15 00:59:14,855 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9422473320778405 [2025-03-15 00:59:14,856 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -15 predicate places. [2025-03-15 00:59:14,856 INFO L471 AbstractCegarLoop]: Abstraction has has 496 places, 477 transitions, 1536 flow [2025-03-15 00:59:14,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:14,857 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:14,857 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] [2025-03-15 00:59:14,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:59:14,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:14,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:14,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1514163031, now seen corresponding path program 1 times [2025-03-15 00:59:14,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:14,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431422327] [2025-03-15 00:59:14,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:14,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:15,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:15,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431422327] [2025-03-15 00:59:15,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431422327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:15,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:15,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563963204] [2025-03-15 00:59:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:15,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 00:59:15,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:15,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 00:59:15,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-15 00:59:15,025 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 531 [2025-03-15 00:59:15,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 477 transitions, 1536 flow. Second operand has 5 states, 5 states have (on average 482.6) internal successors, (2413), 5 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:15,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:15,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 531 [2025-03-15 00:59:15,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:15,530 INFO L124 PetriNetUnfolderBase]: 752/3294 cut-off events. [2025-03-15 00:59:15,530 INFO L125 PetriNetUnfolderBase]: For 37318/39646 co-relation queries the response was YES. [2025-03-15 00:59:15,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7631 conditions, 3294 events. 752/3294 cut-off events. For 37318/39646 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 23749 event pairs, 578 based on Foata normal form. 0/2817 useless extension candidates. Maximal degree in co-relation 2942. Up to 1406 conditions per place. [2025-03-15 00:59:15,548 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 41 selfloop transitions, 7 changer transitions 23/492 dead transitions. [2025-03-15 00:59:15,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 492 transitions, 1754 flow [2025-03-15 00:59:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:59:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:59:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2449 transitions. [2025-03-15 00:59:15,552 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9224105461393597 [2025-03-15 00:59:15,552 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -11 predicate places. [2025-03-15 00:59:15,552 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 492 transitions, 1754 flow [2025-03-15 00:59:15,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 482.6) internal successors, (2413), 5 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:15,553 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:15,554 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 00:59:15,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:59:15,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:15,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1885308031, now seen corresponding path program 1 times [2025-03-15 00:59:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:15,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827184049] [2025-03-15 00:59:15,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:15,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:15,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827184049] [2025-03-15 00:59:15,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827184049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:15,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:15,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:15,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665522495] [2025-03-15 00:59:15,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:15,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:15,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:15,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:15,668 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 531 [2025-03-15 00:59:15,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 492 transitions, 1754 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:15,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:15,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 531 [2025-03-15 00:59:15,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:16,170 INFO L124 PetriNetUnfolderBase]: 796/3596 cut-off events. [2025-03-15 00:59:16,170 INFO L125 PetriNetUnfolderBase]: For 46956/49326 co-relation queries the response was YES. [2025-03-15 00:59:16,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8755 conditions, 3596 events. 796/3596 cut-off events. For 46956/49326 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 26645 event pairs, 550 based on Foata normal form. 0/3103 useless extension candidates. Maximal degree in co-relation 3121. Up to 1475 conditions per place. [2025-03-15 00:59:16,190 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 22 selfloop transitions, 3 changer transitions 23/498 dead transitions. [2025-03-15 00:59:16,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 498 transitions, 1966 flow [2025-03-15 00:59:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2025-03-15 00:59:16,193 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9516635279347144 [2025-03-15 00:59:16,193 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -12 predicate places. [2025-03-15 00:59:16,193 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 498 transitions, 1966 flow [2025-03-15 00:59:16,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:16,194 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:16,194 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] [2025-03-15 00:59:16,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:59:16,195 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:16,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1118553598, now seen corresponding path program 1 times [2025-03-15 00:59:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:16,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996963438] [2025-03-15 00:59:16,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:16,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:16,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996963438] [2025-03-15 00:59:16,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996963438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:16,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:16,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118124203] [2025-03-15 00:59:16,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:16,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:16,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:16,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:16,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:16,246 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 531 [2025-03-15 00:59:16,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 498 transitions, 1966 flow. Second operand has 3 states, 3 states have (on average 502.6666666666667) internal successors, (1508), 3 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:16,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:16,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 531 [2025-03-15 00:59:16,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:16,714 INFO L124 PetriNetUnfolderBase]: 842/4018 cut-off events. [2025-03-15 00:59:16,714 INFO L125 PetriNetUnfolderBase]: For 47809/50457 co-relation queries the response was YES. [2025-03-15 00:59:16,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10016 conditions, 4018 events. 842/4018 cut-off events. For 47809/50457 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 31809 event pairs, 568 based on Foata normal form. 60/3525 useless extension candidates. Maximal degree in co-relation 3458. Up to 1541 conditions per place. [2025-03-15 00:59:16,732 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 31 selfloop transitions, 2 changer transitions 23/509 dead transitions. [2025-03-15 00:59:16,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 509 transitions, 2351 flow [2025-03-15 00:59:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1520 transitions. [2025-03-15 00:59:16,735 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9541745134965474 [2025-03-15 00:59:16,736 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -12 predicate places. [2025-03-15 00:59:16,740 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 509 transitions, 2351 flow [2025-03-15 00:59:16,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.6666666666667) internal successors, (1508), 3 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:16,741 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:16,741 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] [2025-03-15 00:59:16,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:59:16,741 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:16,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1188144636, now seen corresponding path program 1 times [2025-03-15 00:59:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699737433] [2025-03-15 00:59:16,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:16,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699737433] [2025-03-15 00:59:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699737433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:16,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:16,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:16,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503512800] [2025-03-15 00:59:16,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:16,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:16,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:16,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:16,800 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 531 [2025-03-15 00:59:16,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 509 transitions, 2351 flow. Second operand has 3 states, 3 states have (on average 502.6666666666667) internal successors, (1508), 3 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:16,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:16,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 531 [2025-03-15 00:59:16,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:17,427 INFO L124 PetriNetUnfolderBase]: 851/4168 cut-off events. [2025-03-15 00:59:17,428 INFO L125 PetriNetUnfolderBase]: For 63898/67081 co-relation queries the response was YES. [2025-03-15 00:59:17,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10924 conditions, 4168 events. 851/4168 cut-off events. For 63898/67081 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 33374 event pairs, 500 based on Foata normal form. 117/3738 useless extension candidates. Maximal degree in co-relation 3603. Up to 1605 conditions per place. [2025-03-15 00:59:17,455 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 37 selfloop transitions, 2 changer transitions 23/515 dead transitions. [2025-03-15 00:59:17,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 515 transitions, 2615 flow [2025-03-15 00:59:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1520 transitions. [2025-03-15 00:59:17,458 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9541745134965474 [2025-03-15 00:59:17,458 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -12 predicate places. [2025-03-15 00:59:17,458 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 515 transitions, 2615 flow [2025-03-15 00:59:17,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.6666666666667) internal successors, (1508), 3 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:17,459 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:17,459 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] [2025-03-15 00:59:17,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:59:17,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:17,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:17,460 INFO L85 PathProgramCache]: Analyzing trace with hash -810388056, now seen corresponding path program 1 times [2025-03-15 00:59:17,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:17,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526705242] [2025-03-15 00:59:17,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:17,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:17,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:17,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526705242] [2025-03-15 00:59:17,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526705242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:17,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:17,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 00:59:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357207223] [2025-03-15 00:59:17,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:17,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 00:59:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:17,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 00:59:17,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 00:59:17,620 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 531 [2025-03-15 00:59:17,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 515 transitions, 2615 flow. Second operand has 7 states, 7 states have (on average 429.7142857142857) internal successors, (3008), 7 states have internal predecessors, (3008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:17,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:17,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 531 [2025-03-15 00:59:17,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:18,586 INFO L124 PetriNetUnfolderBase]: 1023/5555 cut-off events. [2025-03-15 00:59:18,586 INFO L125 PetriNetUnfolderBase]: For 153616/165501 co-relation queries the response was YES. [2025-03-15 00:59:18,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17100 conditions, 5555 events. 1023/5555 cut-off events. For 153616/165501 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 46206 event pairs, 560 based on Foata normal form. 178/5035 useless extension candidates. Maximal degree in co-relation 3971. Up to 2086 conditions per place. [2025-03-15 00:59:18,615 INFO L140 encePairwiseOnDemand]: 510/531 looper letters, 182 selfloop transitions, 29 changer transitions 23/612 dead transitions. [2025-03-15 00:59:18,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 612 transitions, 3973 flow [2025-03-15 00:59:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:59:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:59:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4419 transitions. [2025-03-15 00:59:18,623 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8322033898305085 [2025-03-15 00:59:18,624 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, -3 predicate places. [2025-03-15 00:59:18,624 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 612 transitions, 3973 flow [2025-03-15 00:59:18,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 429.7142857142857) internal successors, (3008), 7 states have internal predecessors, (3008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:18,626 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:18,626 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] [2025-03-15 00:59:18,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:59:18,626 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:18,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash 353017268, now seen corresponding path program 1 times [2025-03-15 00:59:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:18,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468146586] [2025-03-15 00:59:18,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:18,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:18,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468146586] [2025-03-15 00:59:18,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468146586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:18,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:18,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230942955] [2025-03-15 00:59:18,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:18,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 00:59:18,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:18,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 00:59:18,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-15 00:59:18,756 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 531 [2025-03-15 00:59:18,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 612 transitions, 3973 flow. Second operand has 5 states, 5 states have (on average 477.4) internal successors, (2387), 5 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:18,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:18,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 531 [2025-03-15 00:59:18,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:19,369 INFO L124 PetriNetUnfolderBase]: 665/4023 cut-off events. [2025-03-15 00:59:19,370 INFO L125 PetriNetUnfolderBase]: For 109493/117134 co-relation queries the response was YES. [2025-03-15 00:59:19,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13642 conditions, 4023 events. 665/4023 cut-off events. For 109493/117134 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 30381 event pairs, 326 based on Foata normal form. 62/3570 useless extension candidates. Maximal degree in co-relation 4948. Up to 1336 conditions per place. [2025-03-15 00:59:19,391 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 85 selfloop transitions, 7 changer transitions 23/608 dead transitions. [2025-03-15 00:59:19,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 608 transitions, 3982 flow [2025-03-15 00:59:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:59:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:59:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2421 transitions. [2025-03-15 00:59:19,395 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.911864406779661 [2025-03-15 00:59:19,396 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, 1 predicate places. [2025-03-15 00:59:19,396 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 608 transitions, 3982 flow [2025-03-15 00:59:19,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 477.4) internal successors, (2387), 5 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:19,396 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:19,396 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] [2025-03-15 00:59:19,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:59:19,397 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:19,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:19,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1984300684, now seen corresponding path program 1 times [2025-03-15 00:59:19,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:19,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534538624] [2025-03-15 00:59:19,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:19,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534538624] [2025-03-15 00:59:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534538624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:19,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:19,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367122345] [2025-03-15 00:59:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:19,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 00:59:19,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:19,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 00:59:19,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 00:59:19,485 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 466 out of 531 [2025-03-15 00:59:19,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 608 transitions, 3982 flow. Second operand has 5 states, 5 states have (on average 470.4) internal successors, (2352), 5 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:19,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:19,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 466 of 531 [2025-03-15 00:59:19,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:20,090 INFO L124 PetriNetUnfolderBase]: 641/4061 cut-off events. [2025-03-15 00:59:20,091 INFO L125 PetriNetUnfolderBase]: For 111555/117855 co-relation queries the response was YES. [2025-03-15 00:59:20,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14218 conditions, 4061 events. 641/4061 cut-off events. For 111555/117855 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 28850 event pairs, 339 based on Foata normal form. 65/3607 useless extension candidates. Maximal degree in co-relation 5101. Up to 1391 conditions per place. [2025-03-15 00:59:20,105 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 105 selfloop transitions, 13 changer transitions 23/626 dead transitions. [2025-03-15 00:59:20,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 626 transitions, 4407 flow [2025-03-15 00:59:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2865 transitions. [2025-03-15 00:59:20,109 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.89924670433145 [2025-03-15 00:59:20,110 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, 6 predicate places. [2025-03-15 00:59:20,110 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 626 transitions, 4407 flow [2025-03-15 00:59:20,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 470.4) internal successors, (2352), 5 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:20,111 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:20,111 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] [2025-03-15 00:59:20,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:59:20,111 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:20,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1814656543, now seen corresponding path program 1 times [2025-03-15 00:59:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:20,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732770289] [2025-03-15 00:59:20,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:20,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:20,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732770289] [2025-03-15 00:59:20,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732770289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:20,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:20,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:20,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661363606] [2025-03-15 00:59:20,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:20,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:20,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:20,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:20,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:20,166 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 491 out of 531 [2025-03-15 00:59:20,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 626 transitions, 4407 flow. Second operand has 3 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:20,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:20,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 491 of 531 [2025-03-15 00:59:20,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:20,857 INFO L124 PetriNetUnfolderBase]: 641/4050 cut-off events. [2025-03-15 00:59:20,857 INFO L125 PetriNetUnfolderBase]: For 129785/136061 co-relation queries the response was YES. [2025-03-15 00:59:20,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14711 conditions, 4050 events. 641/4050 cut-off events. For 129785/136061 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 28770 event pairs, 339 based on Foata normal form. 59/3601 useless extension candidates. Maximal degree in co-relation 5205. Up to 1391 conditions per place. [2025-03-15 00:59:20,878 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 64 selfloop transitions, 2 changer transitions 23/625 dead transitions. [2025-03-15 00:59:20,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 625 transitions, 4537 flow [2025-03-15 00:59:20,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1495 transitions. [2025-03-15 00:59:20,881 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.938480853735091 [2025-03-15 00:59:20,881 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, 7 predicate places. [2025-03-15 00:59:20,882 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 625 transitions, 4537 flow [2025-03-15 00:59:20,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:20,882 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:20,882 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] [2025-03-15 00:59:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:59:20,882 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:20,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash -80647226, now seen corresponding path program 1 times [2025-03-15 00:59:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546236725] [2025-03-15 00:59:20,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:20,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:21,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:21,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546236725] [2025-03-15 00:59:21,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546236725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:21,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:21,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:21,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313740764] [2025-03-15 00:59:21,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:21,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:59:21,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:21,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:59:21,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:59:21,375 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 531 [2025-03-15 00:59:21,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 625 transitions, 4537 flow. Second operand has 6 states, 6 states have (on average 425.0) internal successors, (2550), 6 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:21,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:21,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 531 [2025-03-15 00:59:21,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:22,092 INFO L124 PetriNetUnfolderBase]: 656/4146 cut-off events. [2025-03-15 00:59:22,092 INFO L125 PetriNetUnfolderBase]: For 132877/138965 co-relation queries the response was YES. [2025-03-15 00:59:22,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16323 conditions, 4146 events. 656/4146 cut-off events. For 132877/138965 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 29464 event pairs, 353 based on Foata normal form. 59/3694 useless extension candidates. Maximal degree in co-relation 5903. Up to 1409 conditions per place. [2025-03-15 00:59:22,114 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 160 selfloop transitions, 9 changer transitions 23/623 dead transitions. [2025-03-15 00:59:22,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 623 transitions, 4861 flow [2025-03-15 00:59:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2625 transitions. [2025-03-15 00:59:22,117 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8239171374764596 [2025-03-15 00:59:22,117 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, 11 predicate places. [2025-03-15 00:59:22,117 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 623 transitions, 4861 flow [2025-03-15 00:59:22,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 425.0) internal successors, (2550), 6 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:22,118 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:22,118 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] [2025-03-15 00:59:22,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:59:22,118 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:22,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1968750127, now seen corresponding path program 1 times [2025-03-15 00:59:22,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:22,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608524193] [2025-03-15 00:59:22,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:22,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:22,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608524193] [2025-03-15 00:59:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608524193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:22,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:22,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:22,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002704528] [2025-03-15 00:59:22,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:22,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:22,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:22,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:22,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:22,157 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 491 out of 531 [2025-03-15 00:59:22,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 623 transitions, 4861 flow. Second operand has 3 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:22,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:22,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 491 of 531 [2025-03-15 00:59:22,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:22,681 INFO L124 PetriNetUnfolderBase]: 656/4125 cut-off events. [2025-03-15 00:59:22,682 INFO L125 PetriNetUnfolderBase]: For 150763/156854 co-relation queries the response was YES. [2025-03-15 00:59:22,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16794 conditions, 4125 events. 656/4125 cut-off events. For 150763/156854 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 29222 event pairs, 349 based on Foata normal form. 59/3683 useless extension candidates. Maximal degree in co-relation 6006. Up to 1409 conditions per place. [2025-03-15 00:59:22,701 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 64 selfloop transitions, 2 changer transitions 23/622 dead transitions. [2025-03-15 00:59:22,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 622 transitions, 4991 flow [2025-03-15 00:59:22,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1495 transitions. [2025-03-15 00:59:22,703 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.938480853735091 [2025-03-15 00:59:22,703 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, 12 predicate places. [2025-03-15 00:59:22,703 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 622 transitions, 4991 flow [2025-03-15 00:59:22,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:22,703 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:22,704 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] [2025-03-15 00:59:22,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:59:22,704 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:22,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash 503749568, now seen corresponding path program 1 times [2025-03-15 00:59:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:22,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352404038] [2025-03-15 00:59:22,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:22,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:22,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352404038] [2025-03-15 00:59:22,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352404038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:22,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:22,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:22,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239875668] [2025-03-15 00:59:22,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:22,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:22,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:22,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:22,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:22,743 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 495 out of 531 [2025-03-15 00:59:22,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 622 transitions, 4991 flow. Second operand has 3 states, 3 states have (on average 497.6666666666667) internal successors, (1493), 3 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:22,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:22,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 495 of 531 [2025-03-15 00:59:22,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:23,271 INFO L124 PetriNetUnfolderBase]: 653/4003 cut-off events. [2025-03-15 00:59:23,272 INFO L125 PetriNetUnfolderBase]: For 176872/183218 co-relation queries the response was YES. [2025-03-15 00:59:23,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16916 conditions, 4003 events. 653/4003 cut-off events. For 176872/183218 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 28009 event pairs, 349 based on Foata normal form. 59/3609 useless extension candidates. Maximal degree in co-relation 6109. Up to 1385 conditions per place. [2025-03-15 00:59:23,291 INFO L140 encePairwiseOnDemand]: 526/531 looper letters, 58 selfloop transitions, 1 changer transitions 23/618 dead transitions. [2025-03-15 00:59:23,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 618 transitions, 5093 flow [2025-03-15 00:59:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1503 transitions. [2025-03-15 00:59:23,293 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.943502824858757 [2025-03-15 00:59:23,294 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, 10 predicate places. [2025-03-15 00:59:23,294 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 618 transitions, 5093 flow [2025-03-15 00:59:23,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 497.6666666666667) internal successors, (1493), 3 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:23,294 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:23,294 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] [2025-03-15 00:59:23,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 00:59:23,294 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:23,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:23,295 INFO L85 PathProgramCache]: Analyzing trace with hash -155559123, now seen corresponding path program 1 times [2025-03-15 00:59:23,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:23,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818207965] [2025-03-15 00:59:23,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:23,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:59:23,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:23,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818207965] [2025-03-15 00:59:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818207965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:23,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203813294] [2025-03-15 00:59:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:23,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:59:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:23,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:59:23,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:59:23,623 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 531 [2025-03-15 00:59:23,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 618 transitions, 5093 flow. Second operand has 6 states, 6 states have (on average 430.5) internal successors, (2583), 6 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:23,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:23,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 531 [2025-03-15 00:59:23,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:24,677 INFO L124 PetriNetUnfolderBase]: 1097/5328 cut-off events. [2025-03-15 00:59:24,678 INFO L125 PetriNetUnfolderBase]: For 92062/94670 co-relation queries the response was YES. [2025-03-15 00:59:24,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23008 conditions, 5328 events. 1097/5328 cut-off events. For 92062/94670 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 38655 event pairs, 517 based on Foata normal form. 24/4776 useless extension candidates. Maximal degree in co-relation 10710. Up to 1951 conditions per place. [2025-03-15 00:59:24,721 INFO L140 encePairwiseOnDemand]: 520/531 looper letters, 232 selfloop transitions, 22 changer transitions 23/712 dead transitions. [2025-03-15 00:59:24,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 712 transitions, 6859 flow [2025-03-15 00:59:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2732 transitions. [2025-03-15 00:59:24,724 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8575015693659761 [2025-03-15 00:59:24,725 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, 15 predicate places. [2025-03-15 00:59:24,725 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 712 transitions, 6859 flow [2025-03-15 00:59:24,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 430.5) internal successors, (2583), 6 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:24,725 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:24,726 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] [2025-03-15 00:59:24,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:59:24,726 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:24,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash -676354366, now seen corresponding path program 1 times [2025-03-15 00:59:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:24,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803644438] [2025-03-15 00:59:24,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:24,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:24,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803644438] [2025-03-15 00:59:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803644438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:24,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:24,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:24,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506525392] [2025-03-15 00:59:24,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:24,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:24,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:24,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:24,772 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 495 out of 531 [2025-03-15 00:59:24,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 712 transitions, 6859 flow. Second operand has 3 states, 3 states have (on average 497.6666666666667) internal successors, (1493), 3 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:24,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:24,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 495 of 531 [2025-03-15 00:59:24,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:25,605 INFO L124 PetriNetUnfolderBase]: 1108/5501 cut-off events. [2025-03-15 00:59:25,605 INFO L125 PetriNetUnfolderBase]: For 101208/103659 co-relation queries the response was YES. [2025-03-15 00:59:25,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23727 conditions, 5501 events. 1108/5501 cut-off events. For 101208/103659 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 40651 event pairs, 515 based on Foata normal form. 12/4956 useless extension candidates. Maximal degree in co-relation 10813. Up to 1951 conditions per place. [2025-03-15 00:59:25,646 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 70 selfloop transitions, 3 changer transitions 23/710 dead transitions. [2025-03-15 00:59:25,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 710 transitions, 6997 flow [2025-03-15 00:59:25,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1505 transitions. [2025-03-15 00:59:25,648 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9447583176396736 [2025-03-15 00:59:25,649 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, 13 predicate places. [2025-03-15 00:59:25,649 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 710 transitions, 6997 flow [2025-03-15 00:59:25,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 497.6666666666667) internal successors, (1493), 3 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:25,649 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:25,649 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] [2025-03-15 00:59:25,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 00:59:25,649 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:25,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash -697250779, now seen corresponding path program 1 times [2025-03-15 00:59:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379966024] [2025-03-15 00:59:25,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:59:26,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:26,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379966024] [2025-03-15 00:59:26,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379966024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:26,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:26,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934509824] [2025-03-15 00:59:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:26,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:59:26,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:26,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:59:26,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:59:26,004 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 531 [2025-03-15 00:59:26,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 710 transitions, 6997 flow. Second operand has 6 states, 6 states have (on average 429.6666666666667) internal successors, (2578), 6 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:26,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:26,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 531 [2025-03-15 00:59:26,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:27,212 INFO L124 PetriNetUnfolderBase]: 1265/5847 cut-off events. [2025-03-15 00:59:27,212 INFO L125 PetriNetUnfolderBase]: For 108482/111697 co-relation queries the response was YES. [2025-03-15 00:59:27,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27666 conditions, 5847 events. 1265/5847 cut-off events. For 108482/111697 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 43282 event pairs, 454 based on Foata normal form. 12/5277 useless extension candidates. Maximal degree in co-relation 13826. Up to 2301 conditions per place. [2025-03-15 00:59:27,249 INFO L140 encePairwiseOnDemand]: 512/531 looper letters, 286 selfloop transitions, 55 changer transitions 23/799 dead transitions. [2025-03-15 00:59:27,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 799 transitions, 9103 flow [2025-03-15 00:59:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2717 transitions. [2025-03-15 00:59:27,252 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8527934714375393 [2025-03-15 00:59:27,252 INFO L298 CegarLoopForPetriNet]: 511 programPoint places, 18 predicate places. [2025-03-15 00:59:27,252 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 799 transitions, 9103 flow [2025-03-15 00:59:27,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 429.6666666666667) internal successors, (2578), 6 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:27,253 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:27,253 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] [2025-03-15 00:59:27,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 00:59:27,253 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-15 00:59:27,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1042914787, now seen corresponding path program 1 times [2025-03-15 00:59:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:27,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588373093] [2025-03-15 00:59:27,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat