/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-deagle/arithmetic_prog_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:06:01,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:06:01,704 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:01,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:06:01,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:06:01,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:06:01,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:06:01,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:06:01,752 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:06:01,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:06:01,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:06:01,752 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:06:01,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:06:01,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:06:01,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:06:01,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:06:01,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:06:01,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:06:01,753 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:06:01,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:06:01,753 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:06:01,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:06:01,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:06:01,754 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:06:01,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:06:01,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:06:01,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:06:01,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:06:01,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:06:01,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:06:01,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:06:01,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:06:01,754 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:02,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:06:02,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:06:02,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:06:02,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:06:02,022 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:06:02,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2025-03-15 01:06:03,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e7c176d/8f8c27b1c2264f02b4b9aa43c35a194f/FLAG057b2922f [2025-03-15 01:06:03,464 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:06:03,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2025-03-15 01:06:03,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e7c176d/8f8c27b1c2264f02b4b9aa43c35a194f/FLAG057b2922f [2025-03-15 01:06:03,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e7c176d/8f8c27b1c2264f02b4b9aa43c35a194f [2025-03-15 01:06:03,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:06:03,498 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:06:03,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:06:03,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:06:03,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:06:03,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:06:03" (1/1) ... [2025-03-15 01:06:03,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335e3891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:03, skipping insertion in model container [2025-03-15 01:06:03,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:06:03" (1/1) ... [2025-03-15 01:06:03,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:06:03,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:06:03,782 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:06:03,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:06:03,899 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:06:03,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:03 WrapperNode [2025-03-15 01:06:03,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:06:03,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:06:03,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:06:03,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:06:03,908 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:03" (1/1) ... [2025-03-15 01:06:03,922 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:03" (1/1) ... [2025-03-15 01:06:03,945 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 274 [2025-03-15 01:06:03,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:06:03,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:06:03,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:06:03,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:06:03,953 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:03" (1/1) ... [2025-03-15 01:06:03,953 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:03" (1/1) ... [2025-03-15 01:06:03,957 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:03" (1/1) ... [2025-03-15 01:06:03,958 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:03" (1/1) ... [2025-03-15 01:06:03,970 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:03" (1/1) ... [2025-03-15 01:06:03,972 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:03" (1/1) ... [2025-03-15 01:06:03,979 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:03" (1/1) ... [2025-03-15 01:06:03,981 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:03" (1/1) ... [2025-03-15 01:06:03,982 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:03" (1/1) ... [2025-03-15 01:06:03,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:06:03,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:06:03,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:06:03,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:06:03,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:03" (1/1) ... [2025-03-15 01:06:03,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:06:04,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:06:04,025 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:04,031 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:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-15 01:06:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:06:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:06:04,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:06:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:06:04,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:06:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:06:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:06:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:06:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:06:04,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:06:04,048 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:04,188 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:06:04,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:06:04,549 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:06:04,549 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:06:04,571 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:06:04,571 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 01:06:04,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:06:04 BoogieIcfgContainer [2025-03-15 01:06:04,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:06:04,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:06:04,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:06:04,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:06:04,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:06:03" (1/3) ... [2025-03-15 01:06:04,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53665c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:06:04, skipping insertion in model container [2025-03-15 01:06:04,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:06:03" (2/3) ... [2025-03-15 01:06:04,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53665c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:06:04, skipping insertion in model container [2025-03-15 01:06:04,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:06:04" (3/3) ... [2025-03-15 01:06:04,583 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2025-03-15 01:06:04,595 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:06:04,597 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_ok.i that has 3 procedures, 369 locations, 1 initial locations, 4 loop locations, and 15 error locations. [2025-03-15 01:06:04,597 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:06:04,674 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:06:04,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:06:04,728 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;@d6b8b79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:06:04,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-15 01:06:04,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:06:04,795 INFO L124 PetriNetUnfolderBase]: 0/241 cut-off events. [2025-03-15 01:06:04,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:06:04,797 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:04,797 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:04,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash 876531511, now seen corresponding path program 1 times [2025-03-15 01:06:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:04,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661363606] [2025-03-15 01:06:04,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:04,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:05,265 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:05,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:05,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661363606] [2025-03-15 01:06:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661363606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:05,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:05,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:05,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455851236] [2025-03-15 01:06:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:05,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:05,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:05,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:05,295 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 377 [2025-03-15 01:06:05,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 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:05,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:05,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 377 [2025-03-15 01:06:05,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:05,692 INFO L124 PetriNetUnfolderBase]: 264/1409 cut-off events. [2025-03-15 01:06:05,692 INFO L125 PetriNetUnfolderBase]: For 113/125 co-relation queries the response was YES. [2025-03-15 01:06:05,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1957 conditions, 1409 events. 264/1409 cut-off events. For 113/125 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7504 event pairs, 188 based on Foata normal form. 2/1193 useless extension candidates. Maximal degree in co-relation 1573. Up to 486 conditions per place. [2025-03-15 01:06:05,710 INFO L140 encePairwiseOnDemand]: 370/377 looper letters, 33 selfloop transitions, 2 changer transitions 10/368 dead transitions. [2025-03-15 01:06:05,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 368 transitions, 820 flow [2025-03-15 01:06:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-03-15 01:06:05,726 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9248452696728559 [2025-03-15 01:06:05,729 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-03-15 01:06:05,730 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 368 transitions, 820 flow [2025-03-15 01:06:05,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 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:05,730 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:05,730 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:05,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:06:05,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:05,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2042867022, now seen corresponding path program 1 times [2025-03-15 01:06:05,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:05,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760243710] [2025-03-15 01:06:05,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:05,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:05,956 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:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:05,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760243710] [2025-03-15 01:06:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760243710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461738691] [2025-03-15 01:06:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:05,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:05,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:05,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:05,976 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 377 [2025-03-15 01:06:05,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 368 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 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:05,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:05,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 377 [2025-03-15 01:06:05,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:06,377 INFO L124 PetriNetUnfolderBase]: 370/1449 cut-off events. [2025-03-15 01:06:06,378 INFO L125 PetriNetUnfolderBase]: For 519/544 co-relation queries the response was YES. [2025-03-15 01:06:06,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2567 conditions, 1449 events. 370/1449 cut-off events. For 519/544 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8250 event pairs, 245 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 2158. Up to 616 conditions per place. [2025-03-15 01:06:06,385 INFO L140 encePairwiseOnDemand]: 374/377 looper letters, 29 selfloop transitions, 2 changer transitions 10/367 dead transitions. [2025-03-15 01:06:06,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 367 transitions, 884 flow [2025-03-15 01:06:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2025-03-15 01:06:06,388 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9266136162687887 [2025-03-15 01:06:06,388 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-03-15 01:06:06,388 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 367 transitions, 884 flow [2025-03-15 01:06:06,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 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:06,389 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:06,389 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:06,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:06:06,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:06,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash -242752867, now seen corresponding path program 1 times [2025-03-15 01:06:06,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:06,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735477175] [2025-03-15 01:06:06,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:06,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:06,556 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:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735477175] [2025-03-15 01:06:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735477175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043830389] [2025-03-15 01:06:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:06,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:06,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:06,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:06,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:06,561 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 377 [2025-03-15 01:06:06,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 367 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 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:06,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:06,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 377 [2025-03-15 01:06:06,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:06,897 INFO L124 PetriNetUnfolderBase]: 440/1776 cut-off events. [2025-03-15 01:06:06,898 INFO L125 PetriNetUnfolderBase]: For 1299/1549 co-relation queries the response was YES. [2025-03-15 01:06:06,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 1776 events. 440/1776 cut-off events. For 1299/1549 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10729 event pairs, 147 based on Foata normal form. 5/1522 useless extension candidates. Maximal degree in co-relation 3505. Up to 756 conditions per place. [2025-03-15 01:06:06,914 INFO L140 encePairwiseOnDemand]: 363/377 looper letters, 46 selfloop transitions, 10 changer transitions 10/391 dead transitions. [2025-03-15 01:06:06,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 391 transitions, 1118 flow [2025-03-15 01:06:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1077 transitions. [2025-03-15 01:06:06,918 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9522546419098143 [2025-03-15 01:06:06,918 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 0 predicate places. [2025-03-15 01:06:06,918 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 391 transitions, 1118 flow [2025-03-15 01:06:06,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 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:06,921 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:06,921 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:06,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:06:06,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:06,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:06,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1491032849, now seen corresponding path program 1 times [2025-03-15 01:06:06,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:06,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060637914] [2025-03-15 01:06:06,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:06,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:07,092 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:07,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:07,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060637914] [2025-03-15 01:06:07,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060637914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:07,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:07,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:06:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616016449] [2025-03-15 01:06:07,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:07,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:07,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:07,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:07,098 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 377 [2025-03-15 01:06:07,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 391 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 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:07,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:07,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 377 [2025-03-15 01:06:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:07,468 INFO L124 PetriNetUnfolderBase]: 851/2805 cut-off events. [2025-03-15 01:06:07,468 INFO L125 PetriNetUnfolderBase]: For 4702/5256 co-relation queries the response was YES. [2025-03-15 01:06:07,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7527 conditions, 2805 events. 851/2805 cut-off events. For 4702/5256 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 19092 event pairs, 254 based on Foata normal form. 21/2439 useless extension candidates. Maximal degree in co-relation 7077. Up to 1363 conditions per place. [2025-03-15 01:06:07,492 INFO L140 encePairwiseOnDemand]: 374/377 looper letters, 50 selfloop transitions, 2 changer transitions 10/413 dead transitions. [2025-03-15 01:06:07,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 413 transitions, 1380 flow [2025-03-15 01:06:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2025-03-15 01:06:07,495 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9637488947833776 [2025-03-15 01:06:07,497 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 2 predicate places. [2025-03-15 01:06:07,497 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 413 transitions, 1380 flow [2025-03-15 01:06:07,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 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:07,498 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:07,499 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:07,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:06:07,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:07,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1568603134, now seen corresponding path program 1 times [2025-03-15 01:06:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:07,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112694103] [2025-03-15 01:06:07,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:07,614 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:07,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:07,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112694103] [2025-03-15 01:06:07,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112694103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:07,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:07,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:07,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562589647] [2025-03-15 01:06:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:07,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:07,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:07,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:07,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:07,617 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 377 [2025-03-15 01:06:07,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 413 transitions, 1380 flow. Second operand has 3 states, 3 states have (on average 340.6666666666667) internal successors, (1022), 3 states have internal predecessors, (1022), 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:07,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:07,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 377 [2025-03-15 01:06:07,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:08,170 INFO L124 PetriNetUnfolderBase]: 953/3154 cut-off events. [2025-03-15 01:06:08,170 INFO L125 PetriNetUnfolderBase]: For 7170/8305 co-relation queries the response was YES. [2025-03-15 01:06:08,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9780 conditions, 3154 events. 953/3154 cut-off events. For 7170/8305 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 21775 event pairs, 253 based on Foata normal form. 51/2815 useless extension candidates. Maximal degree in co-relation 9295. Up to 1466 conditions per place. [2025-03-15 01:06:08,202 INFO L140 encePairwiseOnDemand]: 370/377 looper letters, 95 selfloop transitions, 11 changer transitions 10/443 dead transitions. [2025-03-15 01:06:08,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 443 transitions, 1823 flow [2025-03-15 01:06:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-03-15 01:06:08,211 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9389920424403183 [2025-03-15 01:06:08,211 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 4 predicate places. [2025-03-15 01:06:08,211 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 443 transitions, 1823 flow [2025-03-15 01:06:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.6666666666667) internal successors, (1022), 3 states have internal predecessors, (1022), 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:08,212 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:08,212 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:08,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:06:08,212 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:08,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash 286166972, now seen corresponding path program 1 times [2025-03-15 01:06:08,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:08,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341112540] [2025-03-15 01:06:08,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:08,318 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:08,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:08,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341112540] [2025-03-15 01:06:08,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341112540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:08,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:06:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058982104] [2025-03-15 01:06:08,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:08,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:08,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:08,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:08,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:08,321 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 377 [2025-03-15 01:06:08,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 443 transitions, 1823 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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:08,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:08,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 377 [2025-03-15 01:06:08,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:08,833 INFO L124 PetriNetUnfolderBase]: 1295/4169 cut-off events. [2025-03-15 01:06:08,833 INFO L125 PetriNetUnfolderBase]: For 12897/14472 co-relation queries the response was YES. [2025-03-15 01:06:08,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14061 conditions, 4169 events. 1295/4169 cut-off events. For 12897/14472 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 30665 event pairs, 392 based on Foata normal form. 48/3670 useless extension candidates. Maximal degree in co-relation 13417. Up to 1963 conditions per place. [2025-03-15 01:06:08,914 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 94 selfloop transitions, 3 changer transitions 12/479 dead transitions. [2025-03-15 01:06:08,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 479 transitions, 2431 flow [2025-03-15 01:06:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1087 transitions. [2025-03-15 01:06:08,916 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9610963748894783 [2025-03-15 01:06:08,916 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 6 predicate places. [2025-03-15 01:06:08,917 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 479 transitions, 2431 flow [2025-03-15 01:06:08,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 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:08,917 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:08,917 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:08,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:06:08,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash 528248111, now seen corresponding path program 1 times [2025-03-15 01:06:08,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747946651] [2025-03-15 01:06:08,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:09,122 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:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747946651] [2025-03-15 01:06:09,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747946651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:09,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:09,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:06:09,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208067576] [2025-03-15 01:06:09,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:09,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:09,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:09,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:09,124 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 377 [2025-03-15 01:06:09,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 479 transitions, 2431 flow. Second operand has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 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:09,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:09,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 377 [2025-03-15 01:06:09,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:09,441 INFO L124 PetriNetUnfolderBase]: 229/1241 cut-off events. [2025-03-15 01:06:09,441 INFO L125 PetriNetUnfolderBase]: For 8339/8702 co-relation queries the response was YES. [2025-03-15 01:06:09,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4147 conditions, 1241 events. 229/1241 cut-off events. For 8339/8702 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6326 event pairs, 58 based on Foata normal form. 190/1336 useless extension candidates. Maximal degree in co-relation 3461. Up to 469 conditions per place. [2025-03-15 01:06:09,451 INFO L140 encePairwiseOnDemand]: 369/377 looper letters, 26 selfloop transitions, 31 changer transitions 17/414 dead transitions. [2025-03-15 01:06:09,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 414 transitions, 1881 flow [2025-03-15 01:06:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1078 transitions. [2025-03-15 01:06:09,454 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9531388152077808 [2025-03-15 01:06:09,455 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 3 predicate places. [2025-03-15 01:06:09,456 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 414 transitions, 1881 flow [2025-03-15 01:06:09,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 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:09,456 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:09,457 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:09,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:06:09,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:09,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:09,458 INFO L85 PathProgramCache]: Analyzing trace with hash 495974699, now seen corresponding path program 1 times [2025-03-15 01:06:09,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:09,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891132545] [2025-03-15 01:06:09,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:09,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:09,571 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:09,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:09,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891132545] [2025-03-15 01:06:09,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891132545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:09,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:09,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:09,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861917672] [2025-03-15 01:06:09,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:09,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:09,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:09,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:09,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:09,576 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 377 [2025-03-15 01:06:09,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 414 transitions, 1881 flow. Second operand has 3 states, 3 states have (on average 345.0) internal successors, (1035), 3 states have internal predecessors, (1035), 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:09,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:09,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 377 [2025-03-15 01:06:09,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:09,769 INFO L124 PetriNetUnfolderBase]: 218/1208 cut-off events. [2025-03-15 01:06:09,769 INFO L125 PetriNetUnfolderBase]: For 6368/6667 co-relation queries the response was YES. [2025-03-15 01:06:09,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4323 conditions, 1208 events. 218/1208 cut-off events. For 6368/6667 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6011 event pairs, 40 based on Foata normal form. 2/1134 useless extension candidates. Maximal degree in co-relation 3597. Up to 454 conditions per place. [2025-03-15 01:06:09,779 INFO L140 encePairwiseOnDemand]: 369/377 looper letters, 63 selfloop transitions, 4 changer transitions 20/419 dead transitions. [2025-03-15 01:06:09,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 419 transitions, 2158 flow [2025-03-15 01:06:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2025-03-15 01:06:09,782 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9372236958443855 [2025-03-15 01:06:09,784 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 2 predicate places. [2025-03-15 01:06:09,784 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 419 transitions, 2158 flow [2025-03-15 01:06:09,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 345.0) internal successors, (1035), 3 states have internal predecessors, (1035), 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:09,784 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:09,785 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:09,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:06:09,785 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:09,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1737634063, now seen corresponding path program 1 times [2025-03-15 01:06:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:09,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519514418] [2025-03-15 01:06:09,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:09,888 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:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:09,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519514418] [2025-03-15 01:06:09,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519514418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:09,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:09,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:09,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727540817] [2025-03-15 01:06:09,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:09,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:09,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:09,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:09,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:09,891 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 377 [2025-03-15 01:06:09,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 419 transitions, 2158 flow. Second operand has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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:09,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:09,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 377 [2025-03-15 01:06:09,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:10,077 INFO L124 PetriNetUnfolderBase]: 220/1204 cut-off events. [2025-03-15 01:06:10,077 INFO L125 PetriNetUnfolderBase]: For 7882/8233 co-relation queries the response was YES. [2025-03-15 01:06:10,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 1204 events. 220/1204 cut-off events. For 7882/8233 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5983 event pairs, 40 based on Foata normal form. 2/1136 useless extension candidates. Maximal degree in co-relation 3889. Up to 456 conditions per place. [2025-03-15 01:06:10,082 INFO L140 encePairwiseOnDemand]: 374/377 looper letters, 68 selfloop transitions, 2 changer transitions 20/420 dead transitions. [2025-03-15 01:06:10,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 420 transitions, 2352 flow [2025-03-15 01:06:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2025-03-15 01:06:10,085 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9274977895667551 [2025-03-15 01:06:10,085 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 3 predicate places. [2025-03-15 01:06:10,085 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 420 transitions, 2352 flow [2025-03-15 01:06:10,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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:10,086 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:10,086 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:10,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:06:10,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2134868295, now seen corresponding path program 1 times [2025-03-15 01:06:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:10,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811324023] [2025-03-15 01:06:10,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:10,168 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:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:10,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811324023] [2025-03-15 01:06:10,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811324023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:10,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:10,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:10,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165730073] [2025-03-15 01:06:10,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:10,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:10,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:10,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:10,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:10,170 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 377 [2025-03-15 01:06:10,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 420 transitions, 2352 flow. Second operand has 3 states, 3 states have (on average 343.6666666666667) internal successors, (1031), 3 states have internal predecessors, (1031), 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:10,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:10,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 377 [2025-03-15 01:06:10,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:10,349 INFO L124 PetriNetUnfolderBase]: 222/1200 cut-off events. [2025-03-15 01:06:10,349 INFO L125 PetriNetUnfolderBase]: For 9801/10310 co-relation queries the response was YES. [2025-03-15 01:06:10,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5110 conditions, 1200 events. 222/1200 cut-off events. For 9801/10310 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5942 event pairs, 40 based on Foata normal form. 2/1138 useless extension candidates. Maximal degree in co-relation 4303. Up to 452 conditions per place. [2025-03-15 01:06:10,355 INFO L140 encePairwiseOnDemand]: 374/377 looper letters, 75 selfloop transitions, 2 changer transitions 20/421 dead transitions. [2025-03-15 01:06:10,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 421 transitions, 2558 flow [2025-03-15 01:06:10,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-03-15 01:06:10,358 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9204244031830239 [2025-03-15 01:06:10,358 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 4 predicate places. [2025-03-15 01:06:10,358 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 421 transitions, 2558 flow [2025-03-15 01:06:10,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.6666666666667) internal successors, (1031), 3 states have internal predecessors, (1031), 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:10,359 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:10,359 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:06:10,359 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:10,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1433571923, now seen corresponding path program 1 times [2025-03-15 01:06:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:10,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703097689] [2025-03-15 01:06:10,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:06:10,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:10,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703097689] [2025-03-15 01:06:10,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703097689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:06:10,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824711856] [2025-03-15 01:06:10,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:10,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:06:10,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:06:10,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:06:10,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 01:06:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:10,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 01:06:10,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:06:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:06:10,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:06:10,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824711856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:10,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:06:10,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-15 01:06:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510645652] [2025-03-15 01:06:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:10,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:10,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:10,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:10,820 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 377 [2025-03-15 01:06:10,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 421 transitions, 2558 flow. Second operand has 3 states, 3 states have (on average 345.6666666666667) internal successors, (1037), 3 states have internal predecessors, (1037), 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:10,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:10,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 377 [2025-03-15 01:06:10,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:11,006 INFO L124 PetriNetUnfolderBase]: 230/1190 cut-off events. [2025-03-15 01:06:11,007 INFO L125 PetriNetUnfolderBase]: For 12468/13164 co-relation queries the response was YES. [2025-03-15 01:06:11,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5461 conditions, 1190 events. 230/1190 cut-off events. For 12468/13164 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5814 event pairs, 31 based on Foata normal form. 7/1139 useless extension candidates. Maximal degree in co-relation 4618. Up to 454 conditions per place. [2025-03-15 01:06:11,014 INFO L140 encePairwiseOnDemand]: 374/377 looper letters, 75 selfloop transitions, 2 changer transitions 20/426 dead transitions. [2025-03-15 01:06:11,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 426 transitions, 2857 flow [2025-03-15 01:06:11,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1052 transitions. [2025-03-15 01:06:11,017 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9301503094606542 [2025-03-15 01:06:11,017 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 5 predicate places. [2025-03-15 01:06:11,017 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 426 transitions, 2857 flow [2025-03-15 01:06:11,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 345.6666666666667) internal successors, (1037), 3 states have internal predecessors, (1037), 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:11,018 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:11,018 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 01:06:11,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-15 01:06:11,223 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash -793559486, now seen corresponding path program 1 times [2025-03-15 01:06:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:11,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168511133] [2025-03-15 01:06:11,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:11,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:06:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:11,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168511133] [2025-03-15 01:06:11,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168511133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:06:11,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745267027] [2025-03-15 01:06:11,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:11,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:06:11,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:06:11,373 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:06:11,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 01:06:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:11,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 01:06:11,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:06:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:06:11,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:06:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745267027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:11,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:06:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-15 01:06:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33354213] [2025-03-15 01:06:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:11,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:06:11,638 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 377 [2025-03-15 01:06:11,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 426 transitions, 2857 flow. Second operand has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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:11,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:11,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 377 [2025-03-15 01:06:11,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:11,825 INFO L124 PetriNetUnfolderBase]: 262/1235 cut-off events. [2025-03-15 01:06:11,825 INFO L125 PetriNetUnfolderBase]: For 20181/21643 co-relation queries the response was YES. [2025-03-15 01:06:11,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6217 conditions, 1235 events. 262/1235 cut-off events. For 20181/21643 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6095 event pairs, 41 based on Foata normal form. 6/1182 useless extension candidates. Maximal degree in co-relation 5339. Up to 492 conditions per place. [2025-03-15 01:06:11,835 INFO L140 encePairwiseOnDemand]: 374/377 looper letters, 75 selfloop transitions, 2 changer transitions 20/431 dead transitions. [2025-03-15 01:06:11,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 431 transitions, 3172 flow [2025-03-15 01:06:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions. [2025-03-15 01:06:11,838 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9557913351016799 [2025-03-15 01:06:11,840 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 6 predicate places. [2025-03-15 01:06:11,840 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 431 transitions, 3172 flow [2025-03-15 01:06:11,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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:11,840 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:11,841 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 01:06:12,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-15 01:06:12,042 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash -191765829, now seen corresponding path program 1 times [2025-03-15 01:06:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766429004] [2025-03-15 01:06:12,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:06:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:06:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:06:12,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:12,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766429004] [2025-03-15 01:06:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766429004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:12,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:12,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:12,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049460188] [2025-03-15 01:06:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:12,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:06:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:12,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:06:12,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:06:12,177 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 377 [2025-03-15 01:06:12,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 431 transitions, 3172 flow. Second operand has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 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:12,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:12,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 377 [2025-03-15 01:06:12,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:12,634 INFO L124 PetriNetUnfolderBase]: 644/2701 cut-off events. [2025-03-15 01:06:12,634 INFO L125 PetriNetUnfolderBase]: For 80004/83438 co-relation queries the response was YES. [2025-03-15 01:06:12,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15365 conditions, 2701 events. 644/2701 cut-off events. For 80004/83438 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 17880 event pairs, 116 based on Foata normal form. 78/2572 useless extension candidates. Maximal degree in co-relation 13582. Up to 1162 conditions per place. [2025-03-15 01:06:12,650 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 165 selfloop transitions, 5 changer transitions 17/520 dead transitions. [2025-03-15 01:06:12,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 520 transitions, 5693 flow [2025-03-15 01:06:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2172 transitions. [2025-03-15 01:06:12,654 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9602122015915119 [2025-03-15 01:06:12,654 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 11 predicate places. [2025-03-15 01:06:12,654 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 520 transitions, 5693 flow [2025-03-15 01:06:12,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 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:12,655 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:12,656 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:06:12,656 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:12,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1828224812, now seen corresponding path program 2 times [2025-03-15 01:06:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:12,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894334437] [2025-03-15 01:06:12,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:06:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:12,690 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:06:12,690 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:06:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 01:06:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894334437] [2025-03-15 01:06:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894334437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:12,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:12,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:06:12,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357248958] [2025-03-15 01:06:12,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:12,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:06:12,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:12,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:06:12,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:06:12,798 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 377 [2025-03-15 01:06:12,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 520 transitions, 5693 flow. Second operand has 5 states, 5 states have (on average 354.8) internal successors, (1774), 5 states have internal predecessors, (1774), 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:12,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:12,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 377 [2025-03-15 01:06:12,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:13,331 INFO L124 PetriNetUnfolderBase]: 864/3283 cut-off events. [2025-03-15 01:06:13,332 INFO L125 PetriNetUnfolderBase]: For 141830/148886 co-relation queries the response was YES. [2025-03-15 01:06:13,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20914 conditions, 3283 events. 864/3283 cut-off events. For 141830/148886 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 21589 event pairs, 144 based on Foata normal form. 83/3087 useless extension candidates. Maximal degree in co-relation 19049. Up to 1469 conditions per place. [2025-03-15 01:06:13,359 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 236 selfloop transitions, 5 changer transitions 19/594 dead transitions. [2025-03-15 01:06:13,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 594 transitions, 8167 flow [2025-03-15 01:06:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:06:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:06:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2165 transitions. [2025-03-15 01:06:13,363 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9571175950486295 [2025-03-15 01:06:13,364 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 16 predicate places. [2025-03-15 01:06:13,364 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 594 transitions, 8167 flow [2025-03-15 01:06:13,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 354.8) internal successors, (1774), 5 states have internal predecessors, (1774), 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:13,365 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:06:13,365 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:06:13,365 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-15 01:06:13,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:06:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1746175962, now seen corresponding path program 3 times [2025-03-15 01:06:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:06:13,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129444055] [2025-03-15 01:06:13,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:06:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:06:13,399 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:06:13,400 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:06:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-15 01:06:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:06:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129444055] [2025-03-15 01:06:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129444055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:06:13,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:06:13,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:06:13,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462481701] [2025-03-15 01:06:13,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:06:13,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:06:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:06:13,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:06:13,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:06:13,447 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 377 [2025-03-15 01:06:13,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 594 transitions, 8167 flow. Second operand has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 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:13,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:06:13,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 377 [2025-03-15 01:06:13,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:06:14,073 INFO L124 PetriNetUnfolderBase]: 861/3372 cut-off events. [2025-03-15 01:06:14,073 INFO L125 PetriNetUnfolderBase]: For 160854/167781 co-relation queries the response was YES. [2025-03-15 01:06:14,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22135 conditions, 3372 events. 861/3372 cut-off events. For 160854/167781 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 22374 event pairs, 143 based on Foata normal form. 15/3105 useless extension candidates. Maximal degree in co-relation 20191. Up to 1491 conditions per place. [2025-03-15 01:06:14,085 INFO L140 encePairwiseOnDemand]: 375/377 looper letters, 0 selfloop transitions, 0 changer transitions 593/593 dead transitions. [2025-03-15 01:06:14,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 593 transitions, 8629 flow [2025-03-15 01:06:14,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:06:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:06:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1079 transitions. [2025-03-15 01:06:14,087 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2025-03-15 01:06:14,088 INFO L298 CegarLoopForPetriNet]: 375 programPoint places, 17 predicate places. [2025-03-15 01:06:14,088 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 593 transitions, 8629 flow [2025-03-15 01:06:14,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 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:14,095 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/arithmetic_prog_ok.i_petrified1_AllErrorsAtOnce [2025-03-15 01:06:14,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining) [2025-03-15 01:06:14,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (10 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (9 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2025-03-15 01:06:14,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2025-03-15 01:06:14,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:06:14,142 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:06:14,146 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:06:14,146 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:06:14,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:06:14 BasicIcfg [2025-03-15 01:06:14,150 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:06:14,152 INFO L158 Benchmark]: Toolchain (without parser) took 10653.05ms. Allocated memory was 71.3MB in the beginning and 323.0MB in the end (delta: 251.7MB). Free memory was 43.1MB in the beginning and 140.7MB in the end (delta: -97.5MB). Peak memory consumption was 362.9MB. Max. memory is 8.0GB. [2025-03-15 01:06:14,152 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:06:14,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.90ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 39.7MB in the end (delta: 3.3MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. [2025-03-15 01:06:14,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.18ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 36.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:06:14,152 INFO L158 Benchmark]: Boogie Preprocessor took 42.66ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 34.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:06:14,152 INFO L158 Benchmark]: RCFGBuilder took 582.47ms. Allocated memory is still 71.3MB. Free memory was 34.4MB in the beginning and 31.4MB in the end (delta: 3.0MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. [2025-03-15 01:06:14,152 INFO L158 Benchmark]: TraceAbstraction took 9574.01ms. Allocated memory was 71.3MB in the beginning and 323.0MB in the end (delta: 251.7MB). Free memory was 30.3MB in the beginning and 140.7MB in the end (delta: -110.3MB). Peak memory consumption was 352.1MB. Max. memory is 8.0GB. [2025-03-15 01:06:14,153 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 402.90ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 39.7MB in the end (delta: 3.3MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.18ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 36.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.66ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 34.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 582.47ms. Allocated memory is still 71.3MB. Free memory was 34.4MB in the beginning and 31.4MB in the end (delta: 3.0MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9574.01ms. Allocated memory was 71.3MB in the beginning and 323.0MB in the end (delta: 251.7MB). Free memory was 30.3MB in the beginning and 140.7MB in the end (delta: -110.3MB). Peak memory consumption was 352.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 880]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 882]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 882]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 902]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 894]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 896]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 902]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 896]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 903]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 897]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 897]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 908]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 909]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 917]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 918]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 457 locations, 28 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.4s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 704 IncrementalHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 176 mSDtfsCounter, 704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 686 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8629occurred in iteration=15, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5064 NumberOfCodeBlocks, 5017 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5047 ConstructedInterpolants, 0 QuantifiedInterpolants, 5365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1324 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 10/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:06:14,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...