/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/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:03:46,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:03:46,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:03:46,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:03:46,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:03:46,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:03:46,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:03:46,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:03:46,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:03:46,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:03:46,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:03:46,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:03:46,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:03:46,782 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:03:46,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:03:46,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:03:46,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:03:46,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:03:46,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:03:46,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:03:46,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:03:46,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:03:46,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:03:47,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:03:47,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:03:47,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:03:47,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:03:47,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:03:47,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2025-03-15 00:03:48,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2626a8619/da382b90cd9a4943a5ceb02e2e496e25/FLAG7d2471415 [2025-03-15 00:03:48,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:03:48,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2025-03-15 00:03:48,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2626a8619/da382b90cd9a4943a5ceb02e2e496e25/FLAG7d2471415 [2025-03-15 00:03:48,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2626a8619/da382b90cd9a4943a5ceb02e2e496e25 [2025-03-15 00:03:48,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:03:48,889 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:03:48,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:03:48,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:03:48,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:03:48,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:03:48" (1/1) ... [2025-03-15 00:03:48,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21efd933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:48, skipping insertion in model container [2025-03-15 00:03:48,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:03:48" (1/1) ... [2025-03-15 00:03:48,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:03:49,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:03:49,274 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:03:49,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:03:49,427 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:03:49,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49 WrapperNode [2025-03-15 00:03:49,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:03:49,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:03:49,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:03:49,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:03:49,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,514 INFO L138 Inliner]: procedures = 277, calls = 431, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 577 [2025-03-15 00:03:49,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:03:49,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:03:49,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:03:49,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:03:49,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:03:49,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:03:49,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:03:49,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:03:49,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (1/1) ... [2025-03-15 00:03:49,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:03:49,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:03:49,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:03:49,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:03:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 00:03:49,640 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 00:03:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 00:03:49,640 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 00:03:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:03:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:03:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:03:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:03:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:03:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:03:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:03:49,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:03:49,642 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:03:49,787 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:03:49,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:03:50,569 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:03:50,569 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:03:50,609 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:03:50,609 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:03:50,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:03:50 BoogieIcfgContainer [2025-03-15 00:03:50,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:03:50,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:03:50,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:03:50,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:03:50,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:03:48" (1/3) ... [2025-03-15 00:03:50,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5214cfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:03:50, skipping insertion in model container [2025-03-15 00:03:50,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:49" (2/3) ... [2025-03-15 00:03:50,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5214cfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:03:50, skipping insertion in model container [2025-03-15 00:03:50,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:03:50" (3/3) ... [2025-03-15 00:03:50,620 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2025-03-15 00:03:50,632 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:03:50,635 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-2.i that has 3 procedures, 594 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-03-15 00:03:50,636 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:03:50,760 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:03:50,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:03:50,818 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;@1d464500, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:03:50,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-15 00:03:50,970 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:03:50,972 INFO L124 PetriNetUnfolderBase]: 0/460 cut-off events. [2025-03-15 00:03:50,974 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:03:50,974 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:50,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:03:50,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-15 00:03:50,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash -707021961, now seen corresponding path program 1 times [2025-03-15 00:03:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:51,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526700471] [2025-03-15 00:03:51,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:03:51,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:51,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526700471] [2025-03-15 00:03:51,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526700471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:51,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:51,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:03:51,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151576397] [2025-03-15 00:03:51,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:51,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:03:51,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:51,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:03:51,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:03:51,726 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 561 out of 603 [2025-03-15 00:03:51,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 603 transitions, 1220 flow. Second operand has 3 states, 3 states have (on average 562.6666666666666) internal successors, (1688), 3 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:51,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:51,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 561 of 603 [2025-03-15 00:03:51,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:52,811 INFO L124 PetriNetUnfolderBase]: 392/3195 cut-off events. [2025-03-15 00:03:52,812 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-03-15 00:03:52,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 3195 events. 392/3195 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 21342 event pairs, 106 based on Foata normal form. 161/3035 useless extension candidates. Maximal degree in co-relation 3320. Up to 509 conditions per place. [2025-03-15 00:03:52,850 INFO L140 encePairwiseOnDemand]: 575/603 looper letters, 44 selfloop transitions, 16 changer transitions 6/617 dead transitions. [2025-03-15 00:03:52,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 617 transitions, 1379 flow [2025-03-15 00:03:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:03:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:03:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2025-03-15 00:03:52,900 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9740187949143173 [2025-03-15 00:03:52,914 INFO L298 CegarLoopForPetriNet]: 600 programPoint places, -6 predicate places. [2025-03-15 00:03:52,916 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 617 transitions, 1379 flow [2025-03-15 00:03:52,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.6666666666666) internal successors, (1688), 3 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:52,918 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:52,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:03:52,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:03:52,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-15 00:03:52,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:52,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1638682231, now seen corresponding path program 1 times [2025-03-15 00:03:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310258113] [2025-03-15 00:03:52,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:03:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310258113] [2025-03-15 00:03:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310258113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:53,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:03:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848407667] [2025-03-15 00:03:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:53,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:03:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:53,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:03:53,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:03:53,562 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 603 [2025-03-15 00:03:53,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 617 transitions, 1379 flow. Second operand has 3 states, 3 states have (on average 577.6666666666666) internal successors, (1733), 3 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:53,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:53,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 603 [2025-03-15 00:03:53,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:54,407 INFO L124 PetriNetUnfolderBase]: 646/4406 cut-off events. [2025-03-15 00:03:54,407 INFO L125 PetriNetUnfolderBase]: For 764/849 co-relation queries the response was YES. [2025-03-15 00:03:54,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 4406 events. 646/4406 cut-off events. For 764/849 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 31905 event pairs, 124 based on Foata normal form. 6/3928 useless extension candidates. Maximal degree in co-relation 5491. Up to 780 conditions per place. [2025-03-15 00:03:54,442 INFO L140 encePairwiseOnDemand]: 598/603 looper letters, 39 selfloop transitions, 3 changer transitions 9/636 dead transitions. [2025-03-15 00:03:54,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 636 transitions, 1557 flow [2025-03-15 00:03:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:03:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:03:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2025-03-15 00:03:54,449 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9729132117191819 [2025-03-15 00:03:54,450 INFO L298 CegarLoopForPetriNet]: 600 programPoint places, -4 predicate places. [2025-03-15 00:03:54,450 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 636 transitions, 1557 flow [2025-03-15 00:03:54,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 577.6666666666666) internal successors, (1733), 3 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:54,451 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:54,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:03:54,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:03:54,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-15 00:03:54,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 838141915, now seen corresponding path program 1 times [2025-03-15 00:03:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:54,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967112945] [2025-03-15 00:03:54,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:54,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:03:56,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:56,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967112945] [2025-03-15 00:03:56,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967112945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:56,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:56,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:03:56,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913272948] [2025-03-15 00:03:56,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:56,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:03:56,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:56,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:03:56,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:03:56,506 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 603 [2025-03-15 00:03:56,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 636 transitions, 1557 flow. Second operand has 6 states, 6 states have (on average 569.1666666666666) internal successors, (3415), 6 states have internal predecessors, (3415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:56,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:56,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 603 [2025-03-15 00:03:56,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:57,755 INFO L124 PetriNetUnfolderBase]: 1053/5587 cut-off events. [2025-03-15 00:03:57,755 INFO L125 PetriNetUnfolderBase]: For 2526/2651 co-relation queries the response was YES. [2025-03-15 00:03:57,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9719 conditions, 5587 events. 1053/5587 cut-off events. For 2526/2651 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 42345 event pairs, 277 based on Foata normal form. 3/5027 useless extension candidates. Maximal degree in co-relation 8586. Up to 1230 conditions per place. [2025-03-15 00:03:57,782 INFO L140 encePairwiseOnDemand]: 592/603 looper letters, 76 selfloop transitions, 22 changer transitions 9/689 dead transitions. [2025-03-15 00:03:57,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 689 transitions, 1989 flow [2025-03-15 00:03:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:03:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:03:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3473 transitions. [2025-03-15 00:03:57,789 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9599226091763405 [2025-03-15 00:03:57,790 INFO L298 CegarLoopForPetriNet]: 600 programPoint places, 1 predicate places. [2025-03-15 00:03:57,790 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 689 transitions, 1989 flow [2025-03-15 00:03:57,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 569.1666666666666) internal successors, (3415), 6 states have internal predecessors, (3415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:57,792 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:57,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:03:57,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:03:57,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-15 00:03:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1957554401, now seen corresponding path program 1 times [2025-03-15 00:03:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:57,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52522204] [2025-03-15 00:03:57,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:57,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:03:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52522204] [2025-03-15 00:03:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52522204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:03:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162393926] [2025-03-15 00:03:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:58,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:03:58,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:58,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:03:58,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:03:58,080 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 603 [2025-03-15 00:03:58,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 689 transitions, 1989 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:58,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:58,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 603 [2025-03-15 00:03:58,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:59,732 INFO L124 PetriNetUnfolderBase]: 1181/6317 cut-off events. [2025-03-15 00:03:59,733 INFO L125 PetriNetUnfolderBase]: For 4896/5359 co-relation queries the response was YES. [2025-03-15 00:03:59,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12409 conditions, 6317 events. 1181/6317 cut-off events. For 4896/5359 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 50346 event pairs, 303 based on Foata normal form. 9/5745 useless extension candidates. Maximal degree in co-relation 11141. Up to 1581 conditions per place. [2025-03-15 00:03:59,790 INFO L140 encePairwiseOnDemand]: 594/603 looper letters, 120 selfloop transitions, 14 changer transitions 9/724 dead transitions. [2025-03-15 00:03:59,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 724 transitions, 2444 flow [2025-03-15 00:03:59,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:03:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:03:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1731 transitions. [2025-03-15 00:03:59,795 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.956882255389718 [2025-03-15 00:03:59,796 INFO L298 CegarLoopForPetriNet]: 600 programPoint places, 3 predicate places. [2025-03-15 00:03:59,796 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 724 transitions, 2444 flow [2025-03-15 00:03:59,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:59,797 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:59,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:03:59,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:03:59,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-15 00:03:59,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1444808414, now seen corresponding path program 1 times [2025-03-15 00:03:59,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:59,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599939205] [2025-03-15 00:03:59,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:59,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:00,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:00,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599939205] [2025-03-15 00:04:00,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599939205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:00,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:00,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:04:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546313991] [2025-03-15 00:04:00,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:00,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:00,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:00,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:00,234 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 603 [2025-03-15 00:04:00,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 724 transitions, 2444 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:00,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:00,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 603 [2025-03-15 00:04:00,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:00,385 INFO L124 PetriNetUnfolderBase]: 121/1201 cut-off events. [2025-03-15 00:04:00,385 INFO L125 PetriNetUnfolderBase]: For 3014/3022 co-relation queries the response was YES. [2025-03-15 00:04:00,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1201 events. 121/1201 cut-off events. For 3014/3022 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4407 event pairs, 3 based on Foata normal form. 154/1314 useless extension candidates. Maximal degree in co-relation 1471. Up to 231 conditions per place. [2025-03-15 00:04:00,392 INFO L140 encePairwiseOnDemand]: 599/603 looper letters, 28 selfloop transitions, 12 changer transitions 12/621 dead transitions. [2025-03-15 00:04:00,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 621 transitions, 1921 flow [2025-03-15 00:04:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2025-03-15 00:04:00,396 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9740187949143173 [2025-03-15 00:04:00,396 INFO L298 CegarLoopForPetriNet]: 600 programPoint places, -4 predicate places. [2025-03-15 00:04:00,396 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 621 transitions, 1921 flow [2025-03-15 00:04:00,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:00,397 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:00,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:00,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:04:00,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-15 00:04:00,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1735463380, now seen corresponding path program 1 times [2025-03-15 00:04:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:00,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841502617] [2025-03-15 00:04:00,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:00,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:00,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841502617] [2025-03-15 00:04:00,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841502617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:00,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:00,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695044487] [2025-03-15 00:04:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:00,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:00,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:00,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:00,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:00,527 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 603 [2025-03-15 00:04:00,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 621 transitions, 1921 flow. Second operand has 3 states, 3 states have (on average 564.6666666666666) internal successors, (1694), 3 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:00,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:00,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 603 [2025-03-15 00:04:00,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:00,799 INFO L124 PetriNetUnfolderBase]: 124/1202 cut-off events. [2025-03-15 00:04:00,800 INFO L125 PetriNetUnfolderBase]: For 2444/2454 co-relation queries the response was YES. [2025-03-15 00:04:00,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1202 events. 124/1202 cut-off events. For 2444/2454 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4392 event pairs, 2 based on Foata normal form. 0/1163 useless extension candidates. Maximal degree in co-relation 1622. Up to 232 conditions per place. [2025-03-15 00:04:00,804 INFO L140 encePairwiseOnDemand]: 600/603 looper letters, 56 selfloop transitions, 2 changer transitions 12/621 dead transitions. [2025-03-15 00:04:00,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 621 transitions, 2062 flow [2025-03-15 00:04:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1703 transitions. [2025-03-15 00:04:00,807 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.941404090657822 [2025-03-15 00:04:00,808 INFO L298 CegarLoopForPetriNet]: 600 programPoint places, -3 predicate places. [2025-03-15 00:04:00,808 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 621 transitions, 2062 flow [2025-03-15 00:04:00,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 564.6666666666666) internal successors, (1694), 3 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:00,811 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:00,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:00,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:04:00,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 22 more)] === [2025-03-15 00:04:00,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash 937881431, now seen corresponding path program 1 times [2025-03-15 00:04:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:00,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349323718] [2025-03-15 00:04:00,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:00,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:02,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349323718] [2025-03-15 00:04:02,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349323718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:02,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:02,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:04:02,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868853359] [2025-03-15 00:04:02,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:02,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:02,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:02,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:02,046 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 603 [2025-03-15 00:04:02,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 621 transitions, 2062 flow. Second operand has 6 states, 6 states have (on average 572.3333333333334) internal successors, (3434), 6 states have internal predecessors, (3434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:02,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:02,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 603 [2025-03-15 00:04:02,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:02,280 INFO L124 PetriNetUnfolderBase]: 131/1209 cut-off events. [2025-03-15 00:04:02,280 INFO L125 PetriNetUnfolderBase]: For 3394/3408 co-relation queries the response was YES. [2025-03-15 00:04:02,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 1209 events. 131/1209 cut-off events. For 3394/3408 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4500 event pairs, 1 based on Foata normal form. 0/1172 useless extension candidates. Maximal degree in co-relation 1752. Up to 239 conditions per place. [2025-03-15 00:04:02,284 INFO L140 encePairwiseOnDemand]: 597/603 looper letters, 0 selfloop transitions, 0 changer transitions 624/624 dead transitions. [2025-03-15 00:04:02,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 624 transitions, 2252 flow [2025-03-15 00:04:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:04:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:04:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3444 transitions. [2025-03-15 00:04:02,290 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9519071310116086 [2025-03-15 00:04:02,291 INFO L298 CegarLoopForPetriNet]: 600 programPoint places, 1 predicate places. [2025-03-15 00:04:02,291 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 624 transitions, 2252 flow [2025-03-15 00:04:02,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 572.3333333333334) internal successors, (3434), 6 states have internal predecessors, (3434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:02,311 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/stack_longer-2.i_petrified1_AllErrorsAtOnce [2025-03-15 00:04:02,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2025-03-15 00:04:02,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2025-03-15 00:04:02,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2025-03-15 00:04:02,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2025-03-15 00:04:02,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:04:02,361 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:02,366 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:04:02,366 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:04:02,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:04:02 BasicIcfg [2025-03-15 00:04:02,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:04:02,372 INFO L158 Benchmark]: Toolchain (without parser) took 13485.14ms. Allocated memory was 71.3MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 41.0MB in the beginning and 621.6MB in the end (delta: -580.7MB). Peak memory consumption was 431.2MB. Max. memory is 8.0GB. [2025-03-15 00:04:02,373 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:04:02,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.10ms. Allocated memory is still 71.3MB. Free memory was 40.8MB in the beginning and 30.7MB in the end (delta: 10.1MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. [2025-03-15 00:04:02,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.44ms. Allocated memory is still 71.3MB. Free memory was 30.7MB in the beginning and 24.7MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:04:02,373 INFO L158 Benchmark]: Boogie Preprocessor took 49.39ms. Allocated memory is still 71.3MB. Free memory was 24.7MB in the beginning and 21.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:04:02,373 INFO L158 Benchmark]: RCFGBuilder took 1044.85ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 20.8MB in the beginning and 43.1MB in the end (delta: -22.3MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2025-03-15 00:04:02,373 INFO L158 Benchmark]: TraceAbstraction took 11757.83ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 42.2MB in the beginning and 621.6MB in the end (delta: -579.5MB). Peak memory consumption was 402.3MB. Max. memory is 8.0GB. [2025-03-15 00:04:02,374 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 was 32.9MB in the beginning and 32.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 538.10ms. Allocated memory is still 71.3MB. Free memory was 40.8MB in the beginning and 30.7MB in the end (delta: 10.1MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.44ms. Allocated memory is still 71.3MB. Free memory was 30.7MB in the beginning and 24.7MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.39ms. Allocated memory is still 71.3MB. Free memory was 24.7MB in the beginning and 21.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1044.85ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 20.8MB in the beginning and 43.1MB in the end (delta: -22.3MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * TraceAbstraction took 11757.83ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 42.2MB in the beginning and 621.6MB in the end (delta: -579.5MB). Peak memory consumption was 402.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 968]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 945]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 945]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1008]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 975]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 983]: 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, 749 locations, 24 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.2s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 121 mSDtfsCounter, 427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2444occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3361 NumberOfCodeBlocks, 3361 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 3354 ConstructedInterpolants, 0 QuantifiedInterpolants, 4602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:04:02,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...