/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/per-thread-array-index.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:06:16,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:06:17,053 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:06:17,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:06:17,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:06:17,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:06:17,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:06:17,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:06:17,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:06:17,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:06:17,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:06:17,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:06:17,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:06:17,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:06:17,081 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:06:17,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:06:17,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:06:17,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:06:17,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:06:17,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:06:17,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:06:17,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:06:17,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:06:17,082 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:06:17,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:06:17,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:06:17,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:06:17,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:06:17,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:06:17,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index.i [2025-03-15 01:06:18,529 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc32433b8/915b17b3ba44455f9476ed8616bbb834/FLAGe5d95c9be [2025-03-15 01:06:18,798 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:06:18,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index.i [2025-03-15 01:06:18,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc32433b8/915b17b3ba44455f9476ed8616bbb834/FLAGe5d95c9be [2025-03-15 01:06:18,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc32433b8/915b17b3ba44455f9476ed8616bbb834 [2025-03-15 01:06:18,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:06:18,830 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:06:18,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:06:18,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:06:18,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:06:18,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:06:18" (1/1) ... [2025-03-15 01:06:18,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1245c98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:18, skipping insertion in model container [2025-03-15 01:06:18,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:06:18" (1/1) ... [2025-03-15 01:06:18,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:06:19,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:06:19,223 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:06:19,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:06:19,323 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:06:19,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19 WrapperNode [2025-03-15 01:06:19,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:06:19,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:06:19,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:06:19,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:06:19,329 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:06:19" (1/1) ... [2025-03-15 01:06:19,341 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:06:19" (1/1) ... [2025-03-15 01:06:19,360 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-15 01:06:19,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:06:19,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:06:19,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:06:19,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:06:19,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:06:19,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:06:19,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:06:19,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:06:19,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (1/1) ... [2025-03-15 01:06:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:06:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:06:19,406 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:06:19,408 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:06:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-15 01:06:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:06:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:06:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:06:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-15 01:06:19,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-15 01:06:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:06:19,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:06:19,426 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:06:19,514 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:06:19,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:06:19,655 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:06:19,655 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:06:19,666 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:06:19,666 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:06:19,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:06:19 BoogieIcfgContainer [2025-03-15 01:06:19,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:06:19,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:06:19,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:06:19,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:06:19,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:06:18" (1/3) ... [2025-03-15 01:06:19,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e17dce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:06:19, skipping insertion in model container [2025-03-15 01:06:19,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:19" (2/3) ... [2025-03-15 01:06:19,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e17dce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:06:19, skipping insertion in model container [2025-03-15 01:06:19,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:06:19" (3/3) ... [2025-03-15 01:06:19,673 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i [2025-03-15 01:06:19,684 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:06:19,685 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-index.i that has 2 procedures, 92 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-15 01:06:19,686 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:06:19,753 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 01:06:19,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:06:19,801 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;@7b1eb9a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:06:19,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-15 01:06:19,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:06:19,823 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-03-15 01:06:19,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:06:19,827 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:19,827 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] [2025-03-15 01:06:19,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 01:06:19,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1619011899, now seen corresponding path program 1 times [2025-03-15 01:06:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022785009] [2025-03-15 01:06:19,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:19,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:19,992 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:06:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:19,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022785009] [2025-03-15 01:06:19,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022785009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:19,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:19,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290513025] [2025-03-15 01:06:19,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:19,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:20,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:20,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:20,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:20,018 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 94 [2025-03-15 01:06:20,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:06:20,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:20,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 94 [2025-03-15 01:06:20,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:20,116 INFO L124 PetriNetUnfolderBase]: 13/205 cut-off events. [2025-03-15 01:06:20,116 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 01:06:20,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 205 events. 13/205 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 587 event pairs, 12 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 169. Up to 41 conditions per place. [2025-03-15 01:06:20,122 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 12 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-03-15 01:06:20,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 219 flow [2025-03-15 01:06:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-03-15 01:06:20,137 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8865248226950354 [2025-03-15 01:06:20,140 INFO L298 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-03-15 01:06:20,140 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 219 flow [2025-03-15 01:06:20,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:06:20,141 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:20,141 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] [2025-03-15 01:06:20,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:06:20,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 01:06:20,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1731049595, now seen corresponding path program 1 times [2025-03-15 01:06:20,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:20,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377793989] [2025-03-15 01:06:20,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:20,240 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:06:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377793989] [2025-03-15 01:06:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377793989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130410748] [2025-03-15 01:06:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:20,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:20,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:20,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:20,242 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2025-03-15 01:06:20,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:06:20,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:20,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2025-03-15 01:06:20,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:20,306 INFO L124 PetriNetUnfolderBase]: 7/188 cut-off events. [2025-03-15 01:06:20,306 INFO L125 PetriNetUnfolderBase]: For 16/22 co-relation queries the response was YES. [2025-03-15 01:06:20,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 188 events. 7/188 cut-off events. For 16/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 427 event pairs, 4 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 141. Up to 27 conditions per place. [2025-03-15 01:06:20,309 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 8 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-03-15 01:06:20,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 239 flow [2025-03-15 01:06:20,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-03-15 01:06:20,311 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9148936170212766 [2025-03-15 01:06:20,311 INFO L298 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-03-15 01:06:20,311 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 239 flow [2025-03-15 01:06:20,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:06:20,311 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:20,311 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] [2025-03-15 01:06:20,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:06:20,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 01:06:20,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash -342989944, now seen corresponding path program 1 times [2025-03-15 01:06:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858400887] [2025-03-15 01:06:20,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:20,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:20,504 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:06:20,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858400887] [2025-03-15 01:06:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858400887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:20,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:20,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:20,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646371732] [2025-03-15 01:06:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:20,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:06:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:20,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:06:20,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:06:20,508 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 94 [2025-03-15 01:06:20,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 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:06:20,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:20,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 94 [2025-03-15 01:06:20,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:20,627 INFO L124 PetriNetUnfolderBase]: 7/185 cut-off events. [2025-03-15 01:06:20,628 INFO L125 PetriNetUnfolderBase]: For 164/193 co-relation queries the response was YES. [2025-03-15 01:06:20,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 185 events. 7/185 cut-off events. For 164/193 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 403 event pairs, 4 based on Foata normal form. 1/172 useless extension candidates. Maximal degree in co-relation 167. Up to 46 conditions per place. [2025-03-15 01:06:20,629 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 40 selfloop transitions, 2 changer transitions 7/106 dead transitions. [2025-03-15 01:06:20,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 106 transitions, 365 flow [2025-03-15 01:06:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2025-03-15 01:06:20,633 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7145390070921985 [2025-03-15 01:06:20,635 INFO L298 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2025-03-15 01:06:20,635 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 365 flow [2025-03-15 01:06:20,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 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:06:20,636 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:20,636 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] [2025-03-15 01:06:20,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:06:20,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 01:06:20,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash 323087230, now seen corresponding path program 1 times [2025-03-15 01:06:20,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:20,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997201240] [2025-03-15 01:06:20,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:20,985 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:06:20,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997201240] [2025-03-15 01:06:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997201240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:20,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:20,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669974840] [2025-03-15 01:06:20,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:20,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:06:20,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:20,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:06:20,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:20,987 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 94 [2025-03-15 01:06:20,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 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:06:20,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:20,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 94 [2025-03-15 01:06:20,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:21,144 INFO L124 PetriNetUnfolderBase]: 164/579 cut-off events. [2025-03-15 01:06:21,144 INFO L125 PetriNetUnfolderBase]: For 185/241 co-relation queries the response was YES. [2025-03-15 01:06:21,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 579 events. 164/579 cut-off events. For 185/241 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3203 event pairs, 102 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 1077. Up to 336 conditions per place. [2025-03-15 01:06:21,148 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 44 selfloop transitions, 26 changer transitions 7/134 dead transitions. [2025-03-15 01:06:21,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 134 transitions, 573 flow [2025-03-15 01:06:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 418 transitions. [2025-03-15 01:06:21,151 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7411347517730497 [2025-03-15 01:06:21,152 INFO L298 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2025-03-15 01:06:21,153 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 134 transitions, 573 flow [2025-03-15 01:06:21,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 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:06:21,153 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:21,153 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] [2025-03-15 01:06:21,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:06:21,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 01:06:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash -179468783, now seen corresponding path program 1 times [2025-03-15 01:06:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:21,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472765609] [2025-03-15 01:06:21,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:21,476 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:06:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472765609] [2025-03-15 01:06:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472765609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:21,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81689178] [2025-03-15 01:06:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:06:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:21,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:06:21,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:21,478 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 94 [2025-03-15 01:06:21,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 134 transitions, 573 flow. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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:06:21,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:21,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 94 [2025-03-15 01:06:21,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:21,743 INFO L124 PetriNetUnfolderBase]: 261/816 cut-off events. [2025-03-15 01:06:21,743 INFO L125 PetriNetUnfolderBase]: For 216/248 co-relation queries the response was YES. [2025-03-15 01:06:21,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 816 events. 261/816 cut-off events. For 216/248 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4870 event pairs, 100 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 2065. Up to 435 conditions per place. [2025-03-15 01:06:21,749 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 68 selfloop transitions, 52 changer transitions 21/199 dead transitions. [2025-03-15 01:06:21,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 199 transitions, 1177 flow [2025-03-15 01:06:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2025-03-15 01:06:21,751 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8528368794326241 [2025-03-15 01:06:21,753 INFO L298 CegarLoopForPetriNet]: 95 programPoint places, 16 predicate places. [2025-03-15 01:06:21,753 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 199 transitions, 1177 flow [2025-03-15 01:06:21,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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:06:21,753 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:21,753 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] [2025-03-15 01:06:21,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:06:21,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 01:06:21,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1767281096, now seen corresponding path program 1 times [2025-03-15 01:06:21,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:21,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027745948] [2025-03-15 01:06:21,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:21,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:22,001 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:06:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:22,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027745948] [2025-03-15 01:06:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027745948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:22,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:22,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330047024] [2025-03-15 01:06:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:22,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:06:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:22,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:06:22,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:22,003 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 94 [2025-03-15 01:06:22,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 199 transitions, 1177 flow. Second operand has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 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:06:22,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:22,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 94 [2025-03-15 01:06:22,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:22,295 INFO L124 PetriNetUnfolderBase]: 305/943 cut-off events. [2025-03-15 01:06:22,295 INFO L125 PetriNetUnfolderBase]: For 463/498 co-relation queries the response was YES. [2025-03-15 01:06:22,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 943 events. 305/943 cut-off events. For 463/498 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5916 event pairs, 111 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 2937. Up to 507 conditions per place. [2025-03-15 01:06:22,301 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 114 selfloop transitions, 25 changer transitions 47/238 dead transitions. [2025-03-15 01:06:22,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 238 transitions, 1770 flow [2025-03-15 01:06:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 430 transitions. [2025-03-15 01:06:22,303 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7624113475177305 [2025-03-15 01:06:22,303 INFO L298 CegarLoopForPetriNet]: 95 programPoint places, 21 predicate places. [2025-03-15 01:06:22,303 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 238 transitions, 1770 flow [2025-03-15 01:06:22,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 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:06:22,304 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:22,304 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2025-03-15 01:06:22,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:06:22,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 01:06:22,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash 222417036, now seen corresponding path program 1 times [2025-03-15 01:06:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:22,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752510806] [2025-03-15 01:06:22,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:06:22,329 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:06:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:06:22,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:06:22,370 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:06:22,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-15 01:06:22,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-15 01:06:22,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-15 01:06:22,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-15 01:06:22,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-15 01:06:22,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-15 01:06:22,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-15 01:06:22,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-15 01:06:22,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-15 01:06:22,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:06:22,374 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:22,375 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:06:22,375 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-15 01:06:22,409 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:06:22,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:06:22,412 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;@7b1eb9a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:06:22,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-15 01:06:22,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:06:22,414 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-03-15 01:06:22,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:06:22,414 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:22,414 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] [2025-03-15 01:06:22,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:22,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash 987440408, now seen corresponding path program 1 times [2025-03-15 01:06:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:22,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916302396] [2025-03-15 01:06:22,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:22,439 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:06:22,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:22,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916302396] [2025-03-15 01:06:22,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916302396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:22,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:22,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477760401] [2025-03-15 01:06:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:22,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:22,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:22,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:22,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:22,443 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2025-03-15 01:06:22,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:06:22,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:22,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2025-03-15 01:06:22,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:22,550 INFO L124 PetriNetUnfolderBase]: 145/998 cut-off events. [2025-03-15 01:06:22,550 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-15 01:06:22,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 998 events. 145/998 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6139 event pairs, 138 based on Foata normal form. 1/837 useless extension candidates. Maximal degree in co-relation 953. Up to 276 conditions per place. [2025-03-15 01:06:22,559 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 17 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2025-03-15 01:06:22,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 280 flow [2025-03-15 01:06:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-03-15 01:06:22,561 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8782608695652174 [2025-03-15 01:06:22,561 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2025-03-15 01:06:22,561 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 280 flow [2025-03-15 01:06:22,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:06:22,562 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:22,562 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] [2025-03-15 01:06:22,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:06:22,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:22,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash -127501339, now seen corresponding path program 1 times [2025-03-15 01:06:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:22,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970862606] [2025-03-15 01:06:22,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:22,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:22,590 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:06:22,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:22,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970862606] [2025-03-15 01:06:22,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970862606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:22,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:22,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:22,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136770390] [2025-03-15 01:06:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:22,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:22,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:22,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:22,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:22,592 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 115 [2025-03-15 01:06:22,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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:06:22,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:22,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 115 [2025-03-15 01:06:22,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:22,667 INFO L124 PetriNetUnfolderBase]: 64/710 cut-off events. [2025-03-15 01:06:22,667 INFO L125 PetriNetUnfolderBase]: For 103/191 co-relation queries the response was YES. [2025-03-15 01:06:22,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 710 events. 64/710 cut-off events. For 103/191 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3789 event pairs, 43 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 647. Up to 135 conditions per place. [2025-03-15 01:06:22,670 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 13 selfloop transitions, 3 changer transitions 1/114 dead transitions. [2025-03-15 01:06:22,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 114 transitions, 321 flow [2025-03-15 01:06:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2025-03-15 01:06:22,674 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9072463768115943 [2025-03-15 01:06:22,674 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2025-03-15 01:06:22,674 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 321 flow [2025-03-15 01:06:22,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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:06:22,675 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:22,675 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] [2025-03-15 01:06:22,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:06:22,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:22,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1226371512, now seen corresponding path program 1 times [2025-03-15 01:06:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:22,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582952484] [2025-03-15 01:06:22,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:22,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:06:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582952484] [2025-03-15 01:06:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582952484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608524193] [2025-03-15 01:06:22,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:22,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:06:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:22,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:06:22,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:06:22,727 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-03-15 01:06:22,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 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:06:22,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:22,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-03-15 01:06:22,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:22,860 INFO L124 PetriNetUnfolderBase]: 64/741 cut-off events. [2025-03-15 01:06:22,860 INFO L125 PetriNetUnfolderBase]: For 862/1147 co-relation queries the response was YES. [2025-03-15 01:06:22,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 741 events. 64/741 cut-off events. For 862/1147 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4124 event pairs, 44 based on Foata normal form. 1/678 useless extension candidates. Maximal degree in co-relation 468. Up to 175 conditions per place. [2025-03-15 01:06:22,864 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 45 selfloop transitions, 2 changer transitions 7/130 dead transitions. [2025-03-15 01:06:22,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 130 transitions, 461 flow [2025-03-15 01:06:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2025-03-15 01:06:22,868 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.755072463768116 [2025-03-15 01:06:22,869 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2025-03-15 01:06:22,869 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 130 transitions, 461 flow [2025-03-15 01:06:22,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 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:06:22,869 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:22,869 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] [2025-03-15 01:06:22,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:06:22,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:22,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:22,870 INFO L85 PathProgramCache]: Analyzing trace with hash -560294338, now seen corresponding path program 1 times [2025-03-15 01:06:22,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:22,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627238755] [2025-03-15 01:06:22,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:22,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:23,031 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:06:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627238755] [2025-03-15 01:06:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627238755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:23,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823896747] [2025-03-15 01:06:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:23,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:06:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:23,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:06:23,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:23,033 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 115 [2025-03-15 01:06:23,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 130 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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:06:23,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:23,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 115 [2025-03-15 01:06:23,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:23,910 INFO L124 PetriNetUnfolderBase]: 3407/7711 cut-off events. [2025-03-15 01:06:23,910 INFO L125 PetriNetUnfolderBase]: For 1918/2234 co-relation queries the response was YES. [2025-03-15 01:06:23,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16219 conditions, 7711 events. 3407/7711 cut-off events. For 1918/2234 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 65653 event pairs, 2194 based on Foata normal form. 0/6677 useless extension candidates. Maximal degree in co-relation 4736. Up to 5110 conditions per place. [2025-03-15 01:06:23,964 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 64 selfloop transitions, 42 changer transitions 7/183 dead transitions. [2025-03-15 01:06:23,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 183 transitions, 802 flow [2025-03-15 01:06:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2025-03-15 01:06:23,966 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2025-03-15 01:06:23,967 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2025-03-15 01:06:23,967 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 183 transitions, 802 flow [2025-03-15 01:06:23,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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:06:23,968 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:23,968 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] [2025-03-15 01:06:23,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:06:23,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:23,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1717093438, now seen corresponding path program 1 times [2025-03-15 01:06:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:23,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749684989] [2025-03-15 01:06:23,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:24,231 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:06:24,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:24,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749684989] [2025-03-15 01:06:24,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749684989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:24,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:24,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:24,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354443612] [2025-03-15 01:06:24,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:24,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:06:24,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:24,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:06:24,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:24,233 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-03-15 01:06:24,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 183 transitions, 802 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 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:06:24,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:24,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-03-15 01:06:24,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:26,355 INFO L124 PetriNetUnfolderBase]: 10126/20941 cut-off events. [2025-03-15 01:06:26,356 INFO L125 PetriNetUnfolderBase]: For 6803/8341 co-relation queries the response was YES. [2025-03-15 01:06:26,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55793 conditions, 20941 events. 10126/20941 cut-off events. For 6803/8341 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 197721 event pairs, 3923 based on Foata normal form. 10/18208 useless extension candidates. Maximal degree in co-relation 32323. Up to 12860 conditions per place. [2025-03-15 01:06:26,531 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 170 selfloop transitions, 93 changer transitions 7/351 dead transitions. [2025-03-15 01:06:26,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 351 transitions, 2204 flow [2025-03-15 01:06:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2025-03-15 01:06:26,536 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2025-03-15 01:06:26,536 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2025-03-15 01:06:26,536 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 351 transitions, 2204 flow [2025-03-15 01:06:26,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 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:06:26,537 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:26,537 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] [2025-03-15 01:06:26,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:06:26,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:26,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1576819970, now seen corresponding path program 1 times [2025-03-15 01:06:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:26,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950663080] [2025-03-15 01:06:26,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:26,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:06:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:26,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950663080] [2025-03-15 01:06:26,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950663080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:26,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:26,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:26,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343985048] [2025-03-15 01:06:26,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:26,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:06:26,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:26,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:06:26,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:26,749 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 115 [2025-03-15 01:06:26,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 351 transitions, 2204 flow. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 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:06:26,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:26,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 115 [2025-03-15 01:06:26,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:29,006 INFO L124 PetriNetUnfolderBase]: 12506/25227 cut-off events. [2025-03-15 01:06:29,006 INFO L125 PetriNetUnfolderBase]: For 13468/15985 co-relation queries the response was YES. [2025-03-15 01:06:29,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83538 conditions, 25227 events. 12506/25227 cut-off events. For 13468/15985 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 238490 event pairs, 4504 based on Foata normal form. 34/21996 useless extension candidates. Maximal degree in co-relation 46878. Up to 15478 conditions per place. [2025-03-15 01:06:29,232 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 292 selfloop transitions, 83 changer transitions 7/470 dead transitions. [2025-03-15 01:06:29,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 470 transitions, 3742 flow [2025-03-15 01:06:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions. [2025-03-15 01:06:29,234 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7840579710144927 [2025-03-15 01:06:29,235 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 20 predicate places. [2025-03-15 01:06:29,235 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 470 transitions, 3742 flow [2025-03-15 01:06:29,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 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:06:29,236 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:29,236 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-03-15 01:06:29,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:06:29,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:29,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1431954075, now seen corresponding path program 1 times [2025-03-15 01:06:29,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:29,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083756698] [2025-03-15 01:06:29,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:29,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:29,645 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:06:29,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:29,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083756698] [2025-03-15 01:06:29,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083756698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:29,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:29,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:06:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381281232] [2025-03-15 01:06:29,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:29,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:06:29,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:29,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:06:29,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:06:29,647 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 115 [2025-03-15 01:06:29,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 470 transitions, 3742 flow. Second operand has 11 states, 11 states have (on average 64.63636363636364) internal successors, (711), 11 states have internal predecessors, (711), 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:06:29,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:29,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 115 [2025-03-15 01:06:29,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:32,314 INFO L124 PetriNetUnfolderBase]: 12394/24860 cut-off events. [2025-03-15 01:06:32,315 INFO L125 PetriNetUnfolderBase]: For 15368/17241 co-relation queries the response was YES. [2025-03-15 01:06:32,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99376 conditions, 24860 events. 12394/24860 cut-off events. For 15368/17241 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 231013 event pairs, 3425 based on Foata normal form. 31/22089 useless extension candidates. Maximal degree in co-relation 55806. Up to 14918 conditions per place. [2025-03-15 01:06:32,495 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 678 selfloop transitions, 40 changer transitions 11/795 dead transitions. [2025-03-15 01:06:32,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 795 transitions, 7638 flow [2025-03-15 01:06:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:06:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:06:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 942 transitions. [2025-03-15 01:06:32,498 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6301003344481605 [2025-03-15 01:06:32,499 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 31 predicate places. [2025-03-15 01:06:32,499 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 795 transitions, 7638 flow [2025-03-15 01:06:32,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.63636363636364) internal successors, (711), 11 states have internal predecessors, (711), 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:06:32,499 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:32,499 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:06:32,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:06:32,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:32,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2135543054, now seen corresponding path program 1 times [2025-03-15 01:06:32,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:32,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434182691] [2025-03-15 01:06:32,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:32,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:32,928 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:06:32,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:32,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434182691] [2025-03-15 01:06:32,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434182691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:32,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:32,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:06:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235655666] [2025-03-15 01:06:32,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:32,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:06:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:32,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:06:32,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:06:32,929 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 115 [2025-03-15 01:06:32,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 795 transitions, 7638 flow. Second operand has 11 states, 11 states have (on average 69.27272727272727) internal successors, (762), 11 states have internal predecessors, (762), 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:06:32,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:32,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 115 [2025-03-15 01:06:32,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:37,540 INFO L124 PetriNetUnfolderBase]: 15192/29895 cut-off events. [2025-03-15 01:06:37,540 INFO L125 PetriNetUnfolderBase]: For 24231/33154 co-relation queries the response was YES. [2025-03-15 01:06:37,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145695 conditions, 29895 events. 15192/29895 cut-off events. For 24231/33154 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 277748 event pairs, 3194 based on Foata normal form. 219/26661 useless extension candidates. Maximal degree in co-relation 90146. Up to 18457 conditions per place. [2025-03-15 01:06:37,772 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 927 selfloop transitions, 435 changer transitions 27/1460 dead transitions. [2025-03-15 01:06:37,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 1460 transitions, 17097 flow [2025-03-15 01:06:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 01:06:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 01:06:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1460 transitions. [2025-03-15 01:06:37,776 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7053140096618358 [2025-03-15 01:06:37,776 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 48 predicate places. [2025-03-15 01:06:37,776 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 1460 transitions, 17097 flow [2025-03-15 01:06:37,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.27272727272727) internal successors, (762), 11 states have internal predecessors, (762), 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:06:37,777 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:37,777 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:37,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:06:37,777 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:37,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:37,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1694103521, now seen corresponding path program 1 times [2025-03-15 01:06:37,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:37,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476616917] [2025-03-15 01:06:37,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:38,049 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:06:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:38,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476616917] [2025-03-15 01:06:38,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476616917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:06:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5153703] [2025-03-15 01:06:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:38,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:06:38,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:38,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:06:38,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:06:38,051 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 115 [2025-03-15 01:06:38,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 1460 transitions, 17097 flow. Second operand has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 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:06:38,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:38,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 115 [2025-03-15 01:06:38,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:42,986 INFO L124 PetriNetUnfolderBase]: 14829/29333 cut-off events. [2025-03-15 01:06:42,986 INFO L125 PetriNetUnfolderBase]: For 31202/34021 co-relation queries the response was YES. [2025-03-15 01:06:43,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162483 conditions, 29333 events. 14829/29333 cut-off events. For 31202/34021 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 273901 event pairs, 3266 based on Foata normal form. 80/26311 useless extension candidates. Maximal degree in co-relation 98811. Up to 17768 conditions per place. [2025-03-15 01:06:43,232 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 1613 selfloop transitions, 72 changer transitions 38/1813 dead transitions. [2025-03-15 01:06:43,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1813 transitions, 24589 flow [2025-03-15 01:06:43,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:06:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:06:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 965 transitions. [2025-03-15 01:06:43,237 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6454849498327759 [2025-03-15 01:06:43,238 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 59 predicate places. [2025-03-15 01:06:43,238 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 1813 transitions, 24589 flow [2025-03-15 01:06:43,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 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:06:43,239 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:43,239 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2025-03-15 01:06:43,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:06:43,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:43,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2022388250, now seen corresponding path program 1 times [2025-03-15 01:06:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088357300] [2025-03-15 01:06:43,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:43,419 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:06:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088357300] [2025-03-15 01:06:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088357300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308792773] [2025-03-15 01:06:43,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:06:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:43,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:06:43,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:43,421 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-03-15 01:06:43,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 1813 transitions, 24589 flow. Second operand has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 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:06:43,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:43,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-03-15 01:06:43,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:52,079 INFO L124 PetriNetUnfolderBase]: 25152/48089 cut-off events. [2025-03-15 01:06:52,080 INFO L125 PetriNetUnfolderBase]: For 96528/108375 co-relation queries the response was YES. [2025-03-15 01:06:52,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286492 conditions, 48089 events. 25152/48089 cut-off events. For 96528/108375 co-relation queries the response was YES. Maximal size of possible extension queue 1850. Compared 469565 event pairs, 5166 based on Foata normal form. 147/43393 useless extension candidates. Maximal degree in co-relation 156571. Up to 27770 conditions per place. [2025-03-15 01:06:52,620 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 2307 selfloop transitions, 1008 changer transitions 306/3743 dead transitions. [2025-03-15 01:06:52,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 3743 transitions, 59253 flow [2025-03-15 01:06:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2025-03-15 01:06:52,621 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.863768115942029 [2025-03-15 01:06:52,622 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 64 predicate places. [2025-03-15 01:06:52,622 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 3743 transitions, 59253 flow [2025-03-15 01:06:52,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 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:06:52,622 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:52,622 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:06:52,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:06:52,622 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-15 01:06:52,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:52,623 INFO L85 PathProgramCache]: Analyzing trace with hash -981390751, now seen corresponding path program 1 times [2025-03-15 01:06:52,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:52,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313696580] [2025-03-15 01:06:52,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:52,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:06:52,647 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:06:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:06:52,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:06:52,666 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-15 01:06:52,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-15 01:06:52,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:06:52,667 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:52,667 WARN L336 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:06:52,667 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-15 01:06:52,691 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 01:06:52,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:06:52,693 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;@7b1eb9a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:06:52,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-15 01:06:52,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:06:52,695 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-03-15 01:06:52,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:06:52,695 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:52,695 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] [2025-03-15 01:06:52,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 01:06:52,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:52,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1606972768, now seen corresponding path program 1 times [2025-03-15 01:06:52,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:52,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337627227] [2025-03-15 01:06:52,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:52,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:52,712 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:06:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337627227] [2025-03-15 01:06:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337627227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532071377] [2025-03-15 01:06:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:52,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:52,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:52,713 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2025-03-15 01:06:52,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:06:52,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:52,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2025-03-15 01:06:52,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:53,171 INFO L124 PetriNetUnfolderBase]: 1133/5305 cut-off events. [2025-03-15 01:06:53,171 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-15 01:06:53,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7252 conditions, 5305 events. 1133/5305 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 50186 event pairs, 1093 based on Foata normal form. 1/4356 useless extension candidates. Maximal degree in co-relation 5449. Up to 1779 conditions per place. [2025-03-15 01:06:53,198 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 22 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-03-15 01:06:53,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 343 flow [2025-03-15 01:06:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-15 01:06:53,200 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8725490196078431 [2025-03-15 01:06:53,200 INFO L298 CegarLoopForPetriNet]: 139 programPoint places, 1 predicate places. [2025-03-15 01:06:53,200 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 134 transitions, 343 flow [2025-03-15 01:06:53,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:06:53,200 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:53,200 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] [2025-03-15 01:06:53,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:06:53,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 01:06:53,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash -322593563, now seen corresponding path program 1 times [2025-03-15 01:06:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:53,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99093686] [2025-03-15 01:06:53,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:53,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:06:53,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99093686] [2025-03-15 01:06:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99093686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:53,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:53,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589272981] [2025-03-15 01:06:53,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:53,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:53,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:53,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:53,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:53,213 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2025-03-15 01:06:53,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 134 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:06:53,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:53,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2025-03-15 01:06:53,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:53,382 INFO L124 PetriNetUnfolderBase]: 403/2989 cut-off events. [2025-03-15 01:06:53,382 INFO L125 PetriNetUnfolderBase]: For 594/1505 co-relation queries the response was YES. [2025-03-15 01:06:53,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4380 conditions, 2989 events. 403/2989 cut-off events. For 594/1505 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 25471 event pairs, 307 based on Foata normal form. 0/2724 useless extension candidates. Maximal degree in co-relation 1436. Up to 674 conditions per place. [2025-03-15 01:06:53,397 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 18 selfloop transitions, 4 changer transitions 1/136 dead transitions. [2025-03-15 01:06:53,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 136 transitions, 407 flow [2025-03-15 01:06:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-15 01:06:53,398 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2025-03-15 01:06:53,399 INFO L298 CegarLoopForPetriNet]: 139 programPoint places, -1 predicate places. [2025-03-15 01:06:53,399 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 407 flow [2025-03-15 01:06:53,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:06:53,399 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:53,399 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] [2025-03-15 01:06:53,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:06:53,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 01:06:53,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash 268566600, now seen corresponding path program 1 times [2025-03-15 01:06:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518596308] [2025-03-15 01:06:53,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:06:53,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518596308] [2025-03-15 01:06:53,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518596308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:53,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:53,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034266859] [2025-03-15 01:06:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:53,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:06:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:53,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:06:53,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:06:53,436 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 136 [2025-03-15 01:06:53,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 136 transitions, 407 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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:06:53,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:53,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 136 [2025-03-15 01:06:53,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:53,634 INFO L124 PetriNetUnfolderBase]: 403/2897 cut-off events. [2025-03-15 01:06:53,635 INFO L125 PetriNetUnfolderBase]: For 5589/8439 co-relation queries the response was YES. [2025-03-15 01:06:53,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 2897 events. 403/2897 cut-off events. For 5589/8439 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 24753 event pairs, 300 based on Foata normal form. 1/2645 useless extension candidates. Maximal degree in co-relation 3174. Up to 677 conditions per place. [2025-03-15 01:06:53,650 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 48 selfloop transitions, 2 changer transitions 7/152 dead transitions. [2025-03-15 01:06:53,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 553 flow [2025-03-15 01:06:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions. [2025-03-15 01:06:53,651 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7806372549019608 [2025-03-15 01:06:53,652 INFO L298 CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places. [2025-03-15 01:06:53,652 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 553 flow [2025-03-15 01:06:53,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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:06:53,652 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:53,652 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] [2025-03-15 01:06:53,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:06:53,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 01:06:53,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash 934643774, now seen corresponding path program 1 times [2025-03-15 01:06:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879694379] [2025-03-15 01:06:53,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:53,748 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:06:53,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:53,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879694379] [2025-03-15 01:06:53,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879694379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:53,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:53,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106854754] [2025-03-15 01:06:53,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:53,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:06:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:53,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:06:53,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:53,749 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 136 [2025-03-15 01:06:53,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 152 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 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:06:53,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:53,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 136 [2025-03-15 01:06:53,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:07:00,962 INFO L124 PetriNetUnfolderBase]: 47808/89474 cut-off events. [2025-03-15 01:07:00,962 INFO L125 PetriNetUnfolderBase]: For 23934/27943 co-relation queries the response was YES. [2025-03-15 01:07:01,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185622 conditions, 89474 events. 47808/89474 cut-off events. For 23934/27943 co-relation queries the response was YES. Maximal size of possible extension queue 2921. Compared 923072 event pairs, 34051 based on Foata normal form. 0/76817 useless extension candidates. Maximal degree in co-relation 46164. Up to 63604 conditions per place. [2025-03-15 01:07:01,773 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 82 selfloop transitions, 58 changer transitions 7/230 dead transitions. [2025-03-15 01:07:01,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 230 transitions, 1025 flow [2025-03-15 01:07:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:07:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:07:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions. [2025-03-15 01:07:01,775 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-03-15 01:07:01,775 INFO L298 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2025-03-15 01:07:01,775 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 230 transitions, 1025 flow [2025-03-15 01:07:01,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 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:07:01,775 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:07:01,775 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] [2025-03-15 01:07:01,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:07:01,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 01:07:01,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:07:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 330540977, now seen corresponding path program 1 times [2025-03-15 01:07:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:07:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874153378] [2025-03-15 01:07:01,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:07:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:07:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:07:01,895 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:07:01,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:07:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874153378] [2025-03-15 01:07:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874153378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:07:01,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:07:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:07:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571287103] [2025-03-15 01:07:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:07:01,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:07:01,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:07:01,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:07:01,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:07:01,897 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 136 [2025-03-15 01:07:01,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 230 transitions, 1025 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 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:07:01,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:07:01,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 136 [2025-03-15 01:07:01,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:07:17,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1022-4-->L1022-5: Formula: (= |v_#memory_int_4| (store |v_#memory_int_5| v_~datas~0.base_10 (store (select |v_#memory_int_5| v_~datas~0.base_10) (+ v_~datas~0.offset_10 (* v_threadThread3of3ForFork0_~i~0_3 4)) |v_threadThread3of3ForFork0_#t~nondet3_5|))) InVars {#memory_int=|v_#memory_int_5|, ~datas~0.base=v_~datas~0.base_10, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_5|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_3, ~datas~0.offset=v_~datas~0.offset_10} OutVars{#memory_int=|v_#memory_int_4|, ~datas~0.base=v_~datas~0.base_10, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_5|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_3, ~datas~0.offset=v_~datas~0.offset_10} AuxVars[] AssignedVars[#memory_int][278], [147#(= |#race~datas~0| 0), 15#L1023true, 161#true, 73#L1022-1true, threadThread1of3ForFork0InUse, 66#ULTIMATE.startFINALtrue, 148#true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 155#true, 142#true, 81#L1022-5true]) [2025-03-15 01:07:17,551 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2025-03-15 01:07:17,551 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-15 01:07:17,551 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-15 01:07:17,551 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-15 01:07:18,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1022-4-->L1022-5: Formula: (= |v_#memory_int_4| (store |v_#memory_int_5| v_~datas~0.base_10 (store (select |v_#memory_int_5| v_~datas~0.base_10) (+ v_~datas~0.offset_10 (* v_threadThread3of3ForFork0_~i~0_3 4)) |v_threadThread3of3ForFork0_#t~nondet3_5|))) InVars {#memory_int=|v_#memory_int_5|, ~datas~0.base=v_~datas~0.base_10, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_5|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_3, ~datas~0.offset=v_~datas~0.offset_10} OutVars{#memory_int=|v_#memory_int_4|, ~datas~0.base=v_~datas~0.base_10, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_5|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_3, ~datas~0.offset=v_~datas~0.offset_10} AuxVars[] AssignedVars[#memory_int][278], [147#(= |#race~datas~0| 0), 15#L1023true, 161#true, 85#L1022-2true, threadThread1of3ForFork0InUse, 66#ULTIMATE.startFINALtrue, 148#true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 155#true, 142#true, 81#L1022-5true]) [2025-03-15 01:07:18,870 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-03-15 01:07:18,870 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-15 01:07:18,870 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-15 01:07:18,870 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-15 01:07:32,649 INFO L124 PetriNetUnfolderBase]: 178192/316952 cut-off events. [2025-03-15 01:07:32,650 INFO L125 PetriNetUnfolderBase]: For 94499/114616 co-relation queries the response was YES. [2025-03-15 01:07:34,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840928 conditions, 316952 events. 178192/316952 cut-off events. For 94499/114616 co-relation queries the response was YES. Maximal size of possible extension queue 9392. Compared 3574730 event pairs, 73736 based on Foata normal form. 82/275500 useless extension candidates. Maximal degree in co-relation 608061. Up to 202387 conditions per place. [2025-03-15 01:07:35,973 INFO L140 encePairwiseOnDemand]: 113/136 looper letters, 255 selfloop transitions, 125 changer transitions 7/480 dead transitions. [2025-03-15 01:07:35,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 480 transitions, 3121 flow [2025-03-15 01:07:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:07:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:07:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2025-03-15 01:07:35,975 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8909313725490197 [2025-03-15 01:07:35,975 INFO L298 CegarLoopForPetriNet]: 139 programPoint places, 14 predicate places. [2025-03-15 01:07:35,975 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 480 transitions, 3121 flow [2025-03-15 01:07:35,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 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:07:35,976 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:07:35,976 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] [2025-03-15 01:07:35,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 01:07:35,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 01:07:35,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:07:35,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1497228185, now seen corresponding path program 1 times [2025-03-15 01:07:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:07:35,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275963496] [2025-03-15 01:07:35,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:07:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:07:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:07:36,098 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:07:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:07:36,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275963496] [2025-03-15 01:07:36,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275963496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:07:36,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:07:36,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:07:36,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107834323] [2025-03-15 01:07:36,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:07:36,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:07:36,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:07:36,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:07:36,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:07:36,099 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 136 [2025-03-15 01:07:36,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 480 transitions, 3121 flow. Second operand has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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:07:36,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:07:36,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 136 [2025-03-15 01:07:36,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:07:58,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1022-4-->L1022-5: Formula: (= |v_#memory_int_4| (store |v_#memory_int_5| v_~datas~0.base_10 (store (select |v_#memory_int_5| v_~datas~0.base_10) (+ v_~datas~0.offset_10 (* v_threadThread3of3ForFork0_~i~0_3 4)) |v_threadThread3of3ForFork0_#t~nondet3_5|))) InVars {#memory_int=|v_#memory_int_5|, ~datas~0.base=v_~datas~0.base_10, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_5|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_3, ~datas~0.offset=v_~datas~0.offset_10} OutVars{#memory_int=|v_#memory_int_4|, ~datas~0.base=v_~datas~0.base_10, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_5|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_3, ~datas~0.offset=v_~datas~0.offset_10} AuxVars[] AssignedVars[#memory_int][323], [161#true, 73#L1022-1true, threadThread1of3ForFork0InUse, 66#ULTIMATE.startFINALtrue, 148#true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 155#true, 167#true, 81#L1022-5true, 147#(= |#race~datas~0| 0), 15#L1023true, 142#true]) [2025-03-15 01:07:58,037 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2025-03-15 01:07:58,037 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-15 01:07:58,037 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-15 01:07:58,037 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-15 01:07:59,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1022-4-->L1022-5: Formula: (= |v_#memory_int_4| (store |v_#memory_int_5| v_~datas~0.base_10 (store (select |v_#memory_int_5| v_~datas~0.base_10) (+ v_~datas~0.offset_10 (* v_threadThread3of3ForFork0_~i~0_3 4)) |v_threadThread3of3ForFork0_#t~nondet3_5|))) InVars {#memory_int=|v_#memory_int_5|, ~datas~0.base=v_~datas~0.base_10, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_5|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_3, ~datas~0.offset=v_~datas~0.offset_10} OutVars{#memory_int=|v_#memory_int_4|, ~datas~0.base=v_~datas~0.base_10, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_5|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_3, ~datas~0.offset=v_~datas~0.offset_10} AuxVars[] AssignedVars[#memory_int][323], [161#true, threadThread1of3ForFork0InUse, 66#ULTIMATE.startFINALtrue, 148#true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 155#true, 81#L1022-5true, 167#true, 147#(= |#race~datas~0| 0), 15#L1023true, 85#L1022-2true, 142#true]) [2025-03-15 01:07:59,568 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-03-15 01:07:59,568 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-15 01:07:59,568 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-15 01:07:59,568 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-15 01:08:19,797 INFO L124 PetriNetUnfolderBase]: 224161/391677 cut-off events. [2025-03-15 01:08:19,797 INFO L125 PetriNetUnfolderBase]: For 169313/203591 co-relation queries the response was YES. [2025-03-15 01:08:21,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1297792 conditions, 391677 events. 224161/391677 cut-off events. For 169313/203591 co-relation queries the response was YES. Maximal size of possible extension queue 10909. Compared 4398715 event pairs, 83592 based on Foata normal form. 458/340803 useless extension candidates. Maximal degree in co-relation 1087034. Up to 248363 conditions per place. [2025-03-15 01:08:24,211 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 431 selfloop transitions, 127 changer transitions 7/670 dead transitions. [2025-03-15 01:08:24,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 670 transitions, 5496 flow [2025-03-15 01:08:24,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:08:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:08:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2025-03-15 01:08:24,212 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7990196078431373 [2025-03-15 01:08:24,213 INFO L298 CegarLoopForPetriNet]: 139 programPoint places, 19 predicate places. [2025-03-15 01:08:24,213 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 670 transitions, 5496 flow [2025-03-15 01:08:24,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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:08:24,214 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:08:24,214 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:08:24,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 01:08:24,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 01:08:24,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:08:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash 558902333, now seen corresponding path program 1 times [2025-03-15 01:08:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:08:24,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281790759] [2025-03-15 01:08:24,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:08:24,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:08:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:08:24,439 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:08:24,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:08:24,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281790759] [2025-03-15 01:08:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281790759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:08:24,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:08:24,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:08:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910623693] [2025-03-15 01:08:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:08:24,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:08:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:08:24,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:08:24,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:08:24,442 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 136 [2025-03-15 01:08:24,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 670 transitions, 5496 flow. Second operand has 11 states, 11 states have (on average 81.36363636363636) internal successors, (895), 11 states have internal predecessors, (895), 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:08:24,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:08:24,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 136 [2025-03-15 01:08:24,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:09:35,901 INFO L124 PetriNetUnfolderBase]: 308473/520859 cut-off events. [2025-03-15 01:09:35,902 INFO L125 PetriNetUnfolderBase]: For 369698/462053 co-relation queries the response was YES. [2025-03-15 01:09:38,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180522 conditions, 520859 events. 308473/520859 cut-off events. For 369698/462053 co-relation queries the response was YES. Maximal size of possible extension queue 15251. Compared 5761130 event pairs, 74027 based on Foata normal form. 4626/455386 useless extension candidates. Maximal degree in co-relation 1048978. Up to 332479 conditions per place. [2025-03-15 01:09:43,055 INFO L140 encePairwiseOnDemand]: 113/136 looper letters, 1081 selfloop transitions, 487 changer transitions 9/1660 dead transitions. [2025-03-15 01:09:43,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 1660 transitions, 16767 flow [2025-03-15 01:09:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 01:09:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 01:09:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1775 transitions. [2025-03-15 01:09:43,058 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7250816993464052 [2025-03-15 01:09:43,059 INFO L298 CegarLoopForPetriNet]: 139 programPoint places, 36 predicate places. [2025-03-15 01:09:43,059 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 1660 transitions, 16767 flow [2025-03-15 01:09:43,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.36363636363636) internal successors, (895), 11 states have internal predecessors, (895), 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:43,059 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:09:43,059 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-03-15 01:09:43,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 01:09:43,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 01:09:43,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:09:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash 684329292, now seen corresponding path program 1 times [2025-03-15 01:09:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:09:43,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654092842] [2025-03-15 01:09:43,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:09:43,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:09:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:09:43,395 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:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:09:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654092842] [2025-03-15 01:09:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654092842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:09:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:09:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:09:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847630383] [2025-03-15 01:09:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:09:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:09:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:09:43,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:09:43,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:09:43,396 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 136 [2025-03-15 01:09:43,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 1660 transitions, 16767 flow. Second operand has 11 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 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:43,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:09:43,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 136 [2025-03-15 01:09:43,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand