/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/pthread-race-challenges/thread-join-counter-inner-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:09:54,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:09:54,588 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 01:09:54,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:09:54,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:09:54,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:09:54,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:09:54,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:09:54,608 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:09:54,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:09:54,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:09:54,608 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:09:54,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:09:54,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:09:54,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:09:54,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:09:54,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:09:54,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:09:54,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:09:54,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:09:54,610 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 01:09:54,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:09:54,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:09:54,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:09:54,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:09:54,869 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:09:54,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-inner-2.i [2025-03-15 01:09:56,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e2aa9a3/539cac8f809f4d76af75f0b8037727d3/FLAG40c1427e1 [2025-03-15 01:09:56,309 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:09:56,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-inner-2.i [2025-03-15 01:09:56,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e2aa9a3/539cac8f809f4d76af75f0b8037727d3/FLAG40c1427e1 [2025-03-15 01:09:56,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e2aa9a3/539cac8f809f4d76af75f0b8037727d3 [2025-03-15 01:09:56,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:09:56,344 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:09:56,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:09:56,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:09:56,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:09:56,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ae9f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56, skipping insertion in model container [2025-03-15 01:09:56,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:09:56,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:09:56,641 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:09:56,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:09:56,712 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:09:56,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56 WrapperNode [2025-03-15 01:09:56,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:09:56,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:09:56,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:09:56,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:09:56,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,745 INFO L138 Inliner]: procedures = 159, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-03-15 01:09:56,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:09:56,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:09:56,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:09:56,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:09:56,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:09:56,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:09:56,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:09:56,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:09:56,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (1/1) ... [2025-03-15 01:09:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:09:56,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:09:56,810 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 01:09:56,812 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 01:09:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:09:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:09:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:09:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-15 01:09:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-15 01:09:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:09:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:09:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:09:56,827 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 01:09:56,929 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:09:56,931 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:09:57,202 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:09:57,202 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:09:57,227 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:09:57,227 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 01:09:57,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:09:57 BoogieIcfgContainer [2025-03-15 01:09:57,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:09:57,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:09:57,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:09:57,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:09:57,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:09:56" (1/3) ... [2025-03-15 01:09:57,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c61c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:09:57, skipping insertion in model container [2025-03-15 01:09:57,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:09:56" (2/3) ... [2025-03-15 01:09:57,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c61c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:09:57, skipping insertion in model container [2025-03-15 01:09:57,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:09:57" (3/3) ... [2025-03-15 01:09:57,236 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-2.i [2025-03-15 01:09:57,247 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:09:57,249 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-inner-2.i that has 2 procedures, 240 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-15 01:09:57,250 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:09:57,314 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:09:57,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:09:57,356 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;@7f04f531, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:09:57,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-15 01:09:57,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:09:57,420 INFO L124 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-03-15 01:09:57,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:09:57,422 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:09:57,422 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] [2025-03-15 01:09:57,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 01:09:57,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:09:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash 676839143, now seen corresponding path program 1 times [2025-03-15 01:09:57,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:09:57,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183115321] [2025-03-15 01:09:57,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:09:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:09:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:09:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:09:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:09:57,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183115321] [2025-03-15 01:09:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183115321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:09:57,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:09:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:09:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145872626] [2025-03-15 01:09:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:09:57,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:09:57,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:09:57,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:09:57,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:09:57,753 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 245 [2025-03-15 01:09:57,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 245 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:09:57,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:09:57,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 245 [2025-03-15 01:09:57,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:09:58,107 INFO L124 PetriNetUnfolderBase]: 357/1448 cut-off events. [2025-03-15 01:09:58,108 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 01:09:58,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 1448 events. 357/1448 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8418 event pairs, 68 based on Foata normal form. 1/1303 useless extension candidates. Maximal degree in co-relation 1970. Up to 444 conditions per place. [2025-03-15 01:09:58,123 INFO L140 encePairwiseOnDemand]: 230/245 looper letters, 47 selfloop transitions, 8 changer transitions 1/264 dead transitions. [2025-03-15 01:09:58,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 264 transitions, 642 flow [2025-03-15 01:09:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:09:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:09:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2025-03-15 01:09:58,138 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9401360544217687 [2025-03-15 01:09:58,141 INFO L298 CegarLoopForPetriNet]: 243 programPoint places, 0 predicate places. [2025-03-15 01:09:58,141 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 264 transitions, 642 flow [2025-03-15 01:09:58,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:09:58,141 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:09:58,142 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] [2025-03-15 01:09:58,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:09:58,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 01:09:58,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:09:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash 453331427, now seen corresponding path program 1 times [2025-03-15 01:09:58,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:09:58,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902506264] [2025-03-15 01:09:58,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:09:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:09:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:09:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:09:58,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:09:58,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902506264] [2025-03-15 01:09:58,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902506264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:09:58,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:09:58,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:09:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062432531] [2025-03-15 01:09:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:09:58,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:09:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:09:58,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:09:58,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:09:58,314 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2025-03-15 01:09:58,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 264 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:09:58,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:09:58,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2025-03-15 01:09:58,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:09:58,541 INFO L124 PetriNetUnfolderBase]: 402/1566 cut-off events. [2025-03-15 01:09:58,542 INFO L125 PetriNetUnfolderBase]: For 235/317 co-relation queries the response was YES. [2025-03-15 01:09:58,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 1566 events. 402/1566 cut-off events. For 235/317 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9262 event pairs, 74 based on Foata normal form. 1/1434 useless extension candidates. Maximal degree in co-relation 2923. Up to 725 conditions per place. [2025-03-15 01:09:58,551 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 76 selfloop transitions, 7 changer transitions 1/290 dead transitions. [2025-03-15 01:09:58,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 290 transitions, 910 flow [2025-03-15 01:09:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:09:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:09:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2025-03-15 01:09:58,553 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9129251700680272 [2025-03-15 01:09:58,554 INFO L298 CegarLoopForPetriNet]: 243 programPoint places, 2 predicate places. [2025-03-15 01:09:58,554 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 290 transitions, 910 flow [2025-03-15 01:09:58,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:09:58,554 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:09:58,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, 1] [2025-03-15 01:09:58,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:09:58,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 01:09:58,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:09:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash 870944845, now seen corresponding path program 1 times [2025-03-15 01:09:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:09:58,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852378990] [2025-03-15 01:09:58,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:09:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:09:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:09:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:09:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:09:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852378990] [2025-03-15 01:09:58,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852378990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:09:58,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:09:58,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:09:58,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564890504] [2025-03-15 01:09:58,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:09:58,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:09:58,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:09:58,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:09:58,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:09:58,677 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 245 [2025-03-15 01:09:58,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 290 transitions, 910 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:09:58,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:09:58,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 245 [2025-03-15 01:09:58,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:09:58,900 INFO L124 PetriNetUnfolderBase]: 512/1852 cut-off events. [2025-03-15 01:09:58,900 INFO L125 PetriNetUnfolderBase]: For 1042/1152 co-relation queries the response was YES. [2025-03-15 01:09:58,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 1852 events. 512/1852 cut-off events. For 1042/1152 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 11723 event pairs, 104 based on Foata normal form. 6/1691 useless extension candidates. Maximal degree in co-relation 4081. Up to 842 conditions per place. [2025-03-15 01:09:58,907 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 59 selfloop transitions, 3 changer transitions 5/305 dead transitions. [2025-03-15 01:09:58,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 305 transitions, 1114 flow [2025-03-15 01:09:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:09:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:09:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2025-03-15 01:09:58,908 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9455782312925171 [2025-03-15 01:09:58,909 INFO L298 CegarLoopForPetriNet]: 243 programPoint places, 4 predicate places. [2025-03-15 01:09:58,909 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 305 transitions, 1114 flow [2025-03-15 01:09:58,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:09:58,909 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:09:58,910 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:09:58,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:09:58,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 01:09:58,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:09:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash 336085697, now seen corresponding path program 1 times [2025-03-15 01:09:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:09:58,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050196613] [2025-03-15 01:09:58,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:09:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:09:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:09:58,951 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:09:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:09:59,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:09:59,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:09:59,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-15 01:09:59,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-15 01:09:59,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:09:59,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-15 01:09:59,060 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:09:59,061 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-15 01:09:59,087 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:09:59,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:09:59,092 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;@7f04f531, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:09:59,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-15 01:09:59,100 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:09:59,100 INFO L124 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-03-15 01:09:59,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:09:59,101 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:09:59,101 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] [2025-03-15 01:09:59,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 01:09:59,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:09:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash 869520779, now seen corresponding path program 1 times [2025-03-15 01:09:59,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:09:59,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249206938] [2025-03-15 01:09:59,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:09:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:09:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:09:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:09:59,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:09:59,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249206938] [2025-03-15 01:09:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249206938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:09:59,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:09:59,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:09:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800559995] [2025-03-15 01:09:59,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:09:59,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:09:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:09:59,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:09:59,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:09:59,207 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 292 [2025-03-15 01:09:59,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 292 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:09:59,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:09:59,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 292 [2025-03-15 01:09:59,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:10:03,042 INFO L124 PetriNetUnfolderBase]: 16149/37944 cut-off events. [2025-03-15 01:10:03,042 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-15 01:10:03,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62978 conditions, 37944 events. 16149/37944 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 402484 event pairs, 4785 based on Foata normal form. 1/32903 useless extension candidates. Maximal degree in co-relation 48432. Up to 13885 conditions per place. [2025-03-15 01:10:03,324 INFO L140 encePairwiseOnDemand]: 267/292 looper letters, 81 selfloop transitions, 16 changer transitions 1/334 dead transitions. [2025-03-15 01:10:03,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 334 transitions, 877 flow [2025-03-15 01:10:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:10:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:10:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 819 transitions. [2025-03-15 01:10:03,327 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.934931506849315 [2025-03-15 01:10:03,328 INFO L298 CegarLoopForPetriNet]: 292 programPoint places, 2 predicate places. [2025-03-15 01:10:03,328 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 334 transitions, 877 flow [2025-03-15 01:10:03,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:03,328 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:10:03,328 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] [2025-03-15 01:10:03,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:10:03,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 01:10:03,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:10:03,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1587673269, now seen corresponding path program 1 times [2025-03-15 01:10:03,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:10:03,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900432074] [2025-03-15 01:10:03,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:10:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:10:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:10:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:10:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:10:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900432074] [2025-03-15 01:10:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900432074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:10:03,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:10:03,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:10:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99689853] [2025-03-15 01:10:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:10:03,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:10:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:10:03,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:10:03,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:10:03,510 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 292 [2025-03-15 01:10:03,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 334 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:03,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:10:03,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 292 [2025-03-15 01:10:03,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:10:07,353 INFO L124 PetriNetUnfolderBase]: 19098/44056 cut-off events. [2025-03-15 01:10:07,353 INFO L125 PetriNetUnfolderBase]: For 5975/12106 co-relation queries the response was YES. [2025-03-15 01:10:07,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101733 conditions, 44056 events. 19098/44056 cut-off events. For 5975/12106 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 471700 event pairs, 4900 based on Foata normal form. 58/38683 useless extension candidates. Maximal degree in co-relation 73753. Up to 26735 conditions per place. [2025-03-15 01:10:07,649 INFO L140 encePairwiseOnDemand]: 282/292 looper letters, 146 selfloop transitions, 17 changer transitions 1/398 dead transitions. [2025-03-15 01:10:07,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 398 transitions, 1462 flow [2025-03-15 01:10:07,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:10:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:10:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2025-03-15 01:10:07,652 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9075342465753424 [2025-03-15 01:10:07,652 INFO L298 CegarLoopForPetriNet]: 292 programPoint places, 4 predicate places. [2025-03-15 01:10:07,652 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 398 transitions, 1462 flow [2025-03-15 01:10:07,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:07,653 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:10:07,653 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] [2025-03-15 01:10:07,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:10:07,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 01:10:07,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:10:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash 663407601, now seen corresponding path program 1 times [2025-03-15 01:10:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:10:07,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004011120] [2025-03-15 01:10:07,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:10:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:10:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:10:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:10:07,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:10:07,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004011120] [2025-03-15 01:10:07,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004011120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:10:07,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:10:07,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:10:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629463352] [2025-03-15 01:10:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:10:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:10:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:10:07,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:10:07,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:10:07,738 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 292 [2025-03-15 01:10:07,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 398 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:07,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:10:07,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 292 [2025-03-15 01:10:07,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:10:13,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([906] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0))) (= |v_threadThread1of2ForFork0_#t~ret11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread1of2ForFork0_#t~ret11=|v_threadThread1of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret11][339], [34#L701-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 301#true, 53#L696-5true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 295#true]) [2025-03-15 01:10:13,690 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-03-15 01:10:13,690 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-15 01:10:13,691 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-15 01:10:13,691 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-15 01:10:13,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([906] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0))) (= |v_threadThread1of2ForFork0_#t~ret11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread1of2ForFork0_#t~ret11=|v_threadThread1of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret11][339], [34#L701-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 301#true, 50#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 295#true]) [2025-03-15 01:10:13,761 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,761 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,761 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,761 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([906] L701-->L701-3: Formula: (and (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0))) (= |v_threadThread1of2ForFork0_#t~ret11_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread1of2ForFork0_#t~ret11=|v_threadThread1of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret11][339], [34#L701-3true, 4#L696-6true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 301#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 295#true]) [2025-03-15 01:10:13,762 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,762 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,762 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,762 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([937] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread2of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread2of2ForFork0_#t~ret7=|v_threadThread2of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret7][343], [114#threadErr4ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 137#L697-3true, 301#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 295#true]) [2025-03-15 01:10:13,769 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,769 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,769 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,769 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([937] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread2of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread2of2ForFork0_#t~ret7=|v_threadThread2of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret7][343], [227#L699-7true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 301#true, 137#L697-3true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 295#true]) [2025-03-15 01:10:13,769 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,770 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,770 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:13,770 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:14,357 INFO L124 PetriNetUnfolderBase]: 28538/65321 cut-off events. [2025-03-15 01:10:14,358 INFO L125 PetriNetUnfolderBase]: For 40519/48299 co-relation queries the response was YES. [2025-03-15 01:10:14,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170011 conditions, 65321 events. 28538/65321 cut-off events. For 40519/48299 co-relation queries the response was YES. Maximal size of possible extension queue 1389. Compared 738719 event pairs, 8327 based on Foata normal form. 253/56628 useless extension candidates. Maximal degree in co-relation 101943. Up to 37197 conditions per place. [2025-03-15 01:10:14,797 INFO L140 encePairwiseOnDemand]: 287/292 looper letters, 120 selfloop transitions, 4 changer transitions 1/441 dead transitions. [2025-03-15 01:10:14,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 441 transitions, 1940 flow [2025-03-15 01:10:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:10:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:10:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2025-03-15 01:10:14,799 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9417808219178082 [2025-03-15 01:10:14,800 INFO L298 CegarLoopForPetriNet]: 292 programPoint places, 6 predicate places. [2025-03-15 01:10:14,800 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 441 transitions, 1940 flow [2025-03-15 01:10:14,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:14,800 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:10:14,800 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] [2025-03-15 01:10:14,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:10:14,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 01:10:14,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:10:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2087896252, now seen corresponding path program 1 times [2025-03-15 01:10:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:10:14,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167625571] [2025-03-15 01:10:14,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:10:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:10:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:10:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:10:14,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:10:14,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167625571] [2025-03-15 01:10:14,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167625571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:10:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:10:14,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:10:14,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394098177] [2025-03-15 01:10:14,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:10:14,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:10:14,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:10:14,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:10:14,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:10:14,861 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 292 [2025-03-15 01:10:14,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 441 transitions, 1940 flow. Second operand has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:14,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:10:14,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 292 [2025-03-15 01:10:14,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:10:17,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][410], [182#L692-6true, 289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 186#L720-1true, 295#true]) [2025-03-15 01:10:17,970 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2025-03-15 01:10:17,970 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 01:10:17,970 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 01:10:17,970 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 01:10:18,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][410], [182#L692-6true, 289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 264#L720-2true, 295#true]) [2025-03-15 01:10:18,288 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,288 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,288 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,288 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][410], [289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 186#L720-1true, 45#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 295#true]) [2025-03-15 01:10:18,288 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,288 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,288 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,288 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][410], [289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 186#L720-1true, 252#L692-7true, 295#true]) [2025-03-15 01:10:18,289 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,289 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,289 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,289 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 01:10:18,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([924] L694-->L694-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret3_1| 0) (= (store |v_#pthreadsMutex_122| |v_~#threads_alive_mutex~0.base_61| (store (select |v_#pthreadsMutex_122| |v_~#threads_alive_mutex~0.base_61|) |v_~#threads_alive_mutex~0.offset_61| 0)) |v_#pthreadsMutex_121|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_61|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_61|} OutVars{threadThread2of2ForFork0_#t~ret3=|v_threadThread2of2ForFork0_#t~ret3_1|, #pthreadsMutex=|v_#pthreadsMutex_121|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_61|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_61|} AuxVars[] AssignedVars[threadThread2of2ForFork0_#t~ret3, #pthreadsMutex][406], [threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 39#L697true, 304#true, 186#L720-1true, 295#true, 94#L694-3true]) [2025-03-15 01:10:18,463 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-15 01:10:18,463 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 01:10:18,463 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 01:10:18,464 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 01:10:18,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][410], [289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 45#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 264#L720-2true, 295#true]) [2025-03-15 01:10:18,471 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-03-15 01:10:18,471 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 01:10:18,471 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 01:10:18,471 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 01:10:18,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][410], [289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 252#L692-7true, 264#L720-2true, 295#true]) [2025-03-15 01:10:18,472 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-03-15 01:10:18,472 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 01:10:18,472 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 01:10:18,472 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 01:10:18,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([924] L694-->L694-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret3_1| 0) (= (store |v_#pthreadsMutex_122| |v_~#threads_alive_mutex~0.base_61| (store (select |v_#pthreadsMutex_122| |v_~#threads_alive_mutex~0.base_61|) |v_~#threads_alive_mutex~0.offset_61| 0)) |v_#pthreadsMutex_121|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_61|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_61|} OutVars{threadThread2of2ForFork0_#t~ret3=|v_threadThread2of2ForFork0_#t~ret3_1|, #pthreadsMutex=|v_#pthreadsMutex_121|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_61|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_61|} AuxVars[] AssignedVars[threadThread2of2ForFork0_#t~ret3, #pthreadsMutex][406], [threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 39#L697true, 304#true, 264#L720-2true, 295#true, 94#L694-3true]) [2025-03-15 01:10:18,817 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-15 01:10:18,817 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-15 01:10:18,817 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-15 01:10:18,817 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-15 01:10:21,947 INFO L124 PetriNetUnfolderBase]: 31435/71004 cut-off events. [2025-03-15 01:10:21,947 INFO L125 PetriNetUnfolderBase]: For 85157/103592 co-relation queries the response was YES. [2025-03-15 01:10:22,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212463 conditions, 71004 events. 31435/71004 cut-off events. For 85157/103592 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 806456 event pairs, 8338 based on Foata normal form. 394/62099 useless extension candidates. Maximal degree in co-relation 163233. Up to 39854 conditions per place. [2025-03-15 01:10:22,626 INFO L140 encePairwiseOnDemand]: 286/292 looper letters, 172 selfloop transitions, 8 changer transitions 1/495 dead transitions. [2025-03-15 01:10:22,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 495 transitions, 2683 flow [2025-03-15 01:10:22,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:10:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:10:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2025-03-15 01:10:22,628 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9417808219178082 [2025-03-15 01:10:22,629 INFO L298 CegarLoopForPetriNet]: 292 programPoint places, 8 predicate places. [2025-03-15 01:10:22,629 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 495 transitions, 2683 flow [2025-03-15 01:10:22,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:22,630 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:10:22,630 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:10:22,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:10:22,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 01:10:22,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:10:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1099810408, now seen corresponding path program 1 times [2025-03-15 01:10:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:10:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166980002] [2025-03-15 01:10:22,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:10:22,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:10:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:10:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:10:22,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:10:22,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166980002] [2025-03-15 01:10:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166980002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:10:22,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:10:22,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:10:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854352015] [2025-03-15 01:10:22,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:10:22,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:10:22,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:10:22,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:10:22,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:10:22,810 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 292 [2025-03-15 01:10:22,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 495 transitions, 2683 flow. Second operand has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:22,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:10:22,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 292 [2025-03-15 01:10:22,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:10:26,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L701-->L701-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret11_1| 0) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread2of2ForFork0_#t~ret11=|v_threadThread2of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret11][473], [threadThread1of2ForFork0InUse, 298#true, 185#L696-5true, threadThread2of2ForFork0InUse, 143#L701-3true, 301#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 307#true, 295#true, 306#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|)]) [2025-03-15 01:10:26,864 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-03-15 01:10:26,864 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-15 01:10:26,865 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-15 01:10:26,865 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-15 01:10:27,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L701-->L701-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret11_1| 0) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread2of2ForFork0_#t~ret11=|v_threadThread2of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret11][473], [threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 143#L701-3true, 301#true, 66#L696-6true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 295#true, 306#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|), 307#true]) [2025-03-15 01:10:27,097 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,097 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,097 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,097 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][238], [289#L697-3true, threadThread1of2ForFork0InUse, 161#threadErr4ASSERT_VIOLATIONDATA_RACEtrue, 298#true, threadThread2of2ForFork0InUse, 301#true, 304#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 295#true, 307#true]) [2025-03-15 01:10:27,235 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,235 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,235 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,235 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][238], [289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 301#true, 304#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 142#L699-7true, 295#true, 307#true]) [2025-03-15 01:10:27,235 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,235 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,235 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,235 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][350], [289#L697-3true, threadThread1of2ForFork0InUse, 298#true, 161#threadErr4ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 264#L720-2true, 295#true, 307#true]) [2025-03-15 01:10:27,244 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][350], [289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 264#L720-2true, 295#true, 307#true, 142#L699-7true]) [2025-03-15 01:10:27,244 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L701-->L701-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret11_1| 0) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread2of2ForFork0_#t~ret11=|v_threadThread2of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret11][492], [threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 143#L701-3true, 303#(= |#race~data~0| 0), 39#L697true, 304#true, 264#L720-2true, 295#true, 307#true]) [2025-03-15 01:10:27,244 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:27,244 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:27,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L701-->L701-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret11_1| 0) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread2of2ForFork0_#t~ret11=|v_threadThread2of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret11][453], [threadThread1of2ForFork0InUse, 298#true, 143#L701-3true, threadThread2of2ForFork0InUse, 39#L697true, 301#true, 304#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 295#true, 307#true]) [2025-03-15 01:10:27,301 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2025-03-15 01:10:27,301 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:27,301 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:27,301 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:27,687 INFO L124 PetriNetUnfolderBase]: 17396/45985 cut-off events. [2025-03-15 01:10:27,687 INFO L125 PetriNetUnfolderBase]: For 115894/126949 co-relation queries the response was YES. [2025-03-15 01:10:27,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144157 conditions, 45985 events. 17396/45985 cut-off events. For 115894/126949 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 543037 event pairs, 4417 based on Foata normal form. 3253/43293 useless extension candidates. Maximal degree in co-relation 111166. Up to 24495 conditions per place. [2025-03-15 01:10:28,021 INFO L140 encePairwiseOnDemand]: 274/292 looper letters, 84 selfloop transitions, 110 changer transitions 1/521 dead transitions. [2025-03-15 01:10:28,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 521 transitions, 3388 flow [2025-03-15 01:10:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:10:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:10:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 832 transitions. [2025-03-15 01:10:28,023 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9497716894977168 [2025-03-15 01:10:28,024 INFO L298 CegarLoopForPetriNet]: 292 programPoint places, 10 predicate places. [2025-03-15 01:10:28,024 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 521 transitions, 3388 flow [2025-03-15 01:10:28,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:28,024 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:10:28,025 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:10:28,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:10:28,025 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 01:10:28,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:10:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1249725656, now seen corresponding path program 1 times [2025-03-15 01:10:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:10:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106964664] [2025-03-15 01:10:28,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:10:28,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:10:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:10:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:10:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:10:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106964664] [2025-03-15 01:10:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106964664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:10:28,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:10:28,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:10:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826069025] [2025-03-15 01:10:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:10:28,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:10:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:10:28,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:10:28,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:10:28,084 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 292 [2025-03-15 01:10:28,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 521 transitions, 3388 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:28,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:10:28,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 292 [2025-03-15 01:10:28,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:10:32,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L701-->L701-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret11_1| 0) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread2of2ForFork0_#t~ret11=|v_threadThread2of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret11][512], [310#true, threadThread1of2ForFork0InUse, 298#true, 185#L696-5true, threadThread2of2ForFork0InUse, 143#L701-3true, 301#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 295#true, 307#true, 306#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|)]) [2025-03-15 01:10:32,722 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2025-03-15 01:10:32,722 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-15 01:10:32,722 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-15 01:10:32,722 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-15 01:10:32,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L701-->L701-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret11_1| 0) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread2of2ForFork0_#t~ret11=|v_threadThread2of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret11][512], [310#true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 143#L701-3true, 301#true, 66#L696-6true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 307#true, 295#true, 306#(= |threadThread1of2ForFork0_#t~nondet6| |#race~data~0|)]) [2025-03-15 01:10:32,803 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:32,803 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:32,803 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:32,803 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][237], [310#true, 289#L697-3true, threadThread1of2ForFork0InUse, 161#threadErr4ASSERT_VIOLATIONDATA_RACEtrue, 298#true, threadThread2of2ForFork0InUse, 301#true, 304#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 307#true, 295#true]) [2025-03-15 01:10:33,129 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,129 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,129 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,129 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][237], [310#true, 289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 301#true, 304#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 307#true, 142#L699-7true, 295#true]) [2025-03-15 01:10:33,129 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,129 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,129 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,129 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][353], [310#true, 289#L697-3true, threadThread1of2ForFork0InUse, 161#threadErr4ASSERT_VIOLATIONDATA_RACEtrue, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 264#L720-2true, 307#true, 295#true]) [2025-03-15 01:10:33,138 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,138 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,138 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,138 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([891] L697-->L697-3: Formula: (and (= (store |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_106| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)) |v_#pthreadsMutex_105|) (= |v_threadThread1of2ForFork0_#t~ret7_1| 0)) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_106|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, threadThread1of2ForFork0_#t~ret7=|v_threadThread1of2ForFork0_#t~ret7_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of2ForFork0_#t~ret7][353], [310#true, 289#L697-3true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 303#(= |#race~data~0| 0), 304#true, 264#L720-2true, 142#L699-7true, 307#true, 295#true]) [2025-03-15 01:10:33,139 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,139 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,139 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,139 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 01:10:33,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L701-->L701-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret11_1| 0) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread2of2ForFork0_#t~ret11=|v_threadThread2of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret11][537], [310#true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 143#L701-3true, 303#(= |#race~data~0| 0), 39#L697true, 304#true, 264#L720-2true, 307#true, 295#true]) [2025-03-15 01:10:33,139 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2025-03-15 01:10:33,139 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:33,139 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:33,139 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:33,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L701-->L701-3: Formula: (and (= |v_threadThread2of2ForFork0_#t~ret11_1| 0) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53| (store (select |v_#pthreadsMutex_98| |v_~#threads_alive_mutex~0.base_53|) |v_~#threads_alive_mutex~0.offset_53| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_53|, threadThread2of2ForFork0_#t~ret11=|v_threadThread2of2ForFork0_#t~ret11_1|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_53|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~ret11][482], [310#true, threadThread1of2ForFork0InUse, 298#true, threadThread2of2ForFork0InUse, 143#L701-3true, 39#L697true, 301#true, 304#true, 228#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 307#true, 295#true]) [2025-03-15 01:10:33,201 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2025-03-15 01:10:33,201 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:33,201 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:33,201 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-15 01:10:33,655 INFO L124 PetriNetUnfolderBase]: 17797/47018 cut-off events. [2025-03-15 01:10:33,655 INFO L125 PetriNetUnfolderBase]: For 141362/157576 co-relation queries the response was YES. [2025-03-15 01:10:33,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172093 conditions, 47018 events. 17797/47018 cut-off events. For 141362/157576 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 557381 event pairs, 4326 based on Foata normal form. 164/41300 useless extension candidates. Maximal degree in co-relation 133613. Up to 24907 conditions per place. [2025-03-15 01:10:34,060 INFO L140 encePairwiseOnDemand]: 284/292 looper letters, 299 selfloop transitions, 13 changer transitions 1/568 dead transitions. [2025-03-15 01:10:34,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 568 transitions, 4440 flow [2025-03-15 01:10:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:10:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:10:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2025-03-15 01:10:34,062 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8972602739726028 [2025-03-15 01:10:34,063 INFO L298 CegarLoopForPetriNet]: 292 programPoint places, 12 predicate places. [2025-03-15 01:10:34,063 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 568 transitions, 4440 flow [2025-03-15 01:10:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:34,063 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:10:34,063 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:10:34,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:10:34,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 01:10:34,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:10:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1497058804, now seen corresponding path program 1 times [2025-03-15 01:10:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:10:34,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015265120] [2025-03-15 01:10:34,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:10:34,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:10:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:10:34,088 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:10:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:10:34,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:10:34,135 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-03-15 01:10:34,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-03-15 01:10:34,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-03-15 01:10:34,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-03-15 01:10:34,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-03-15 01:10:34,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-03-15 01:10:34,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-03-15 01:10:34,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:10:34,136 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:10:34,137 WARN L336 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:10:34,137 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-15 01:10:34,166 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:10:34,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:10:34,171 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;@7f04f531, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:10:34,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-15 01:10:34,178 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:10:34,178 INFO L124 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-03-15 01:10:34,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:10:34,178 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:10:34,178 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:10:34,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-15 01:10:34,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:10:34,179 INFO L85 PathProgramCache]: Analyzing trace with hash -245283842, now seen corresponding path program 1 times [2025-03-15 01:10:34,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:10:34,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838619227] [2025-03-15 01:10:34,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:10:34,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:10:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:10:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:10:34,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:10:34,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838619227] [2025-03-15 01:10:34,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838619227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:10:34,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:10:34,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:10:34,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491449343] [2025-03-15 01:10:34,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:10:34,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:10:34,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:10:34,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:10:34,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:10:34,231 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 339 [2025-03-15 01:10:34,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 339 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:10:34,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:10:34,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 339 [2025-03-15 01:10:34,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand