/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/goblint-regression/28-race_reach_90-arrayloop2_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:51:57,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:51:57,352 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:51:57,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:51:57,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:51:57,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:51:57,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:51:57,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:51:57,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:51:57,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:51:57,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:51:57,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:51:57,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:51:57,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:51:57,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:51:57,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:51:57,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:51:57,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:51:57,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:51:57,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:51:57,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:51:57,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:51:57,377 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:51:57,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:51:57,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:51:57,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:51:57,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:51:57,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:51:57,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-03-15 00:51:58,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b56eae1/6437dcb816674981be893b0fc8f3a9c4/FLAG2735a3bea [2025-03-15 00:51:59,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:51:59,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-03-15 00:51:59,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b56eae1/6437dcb816674981be893b0fc8f3a9c4/FLAG2735a3bea [2025-03-15 00:51:59,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b56eae1/6437dcb816674981be893b0fc8f3a9c4 [2025-03-15 00:51:59,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:51:59,247 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:51:59,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:51:59,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:51:59,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:51:59,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62202688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59, skipping insertion in model container [2025-03-15 00:51:59,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:51:59,632 WARN L1702 CHandler]: Possible shadowing of function new [2025-03-15 00:51:59,633 WARN L1702 CHandler]: Possible shadowing of function new [2025-03-15 00:51:59,633 WARN L1702 CHandler]: Possible shadowing of function new [2025-03-15 00:51:59,634 WARN L1702 CHandler]: Possible shadowing of function new [2025-03-15 00:51:59,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:51:59,700 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:51:59,749 WARN L1702 CHandler]: Possible shadowing of function new [2025-03-15 00:51:59,749 WARN L1702 CHandler]: Possible shadowing of function new [2025-03-15 00:51:59,750 WARN L1702 CHandler]: Possible shadowing of function new [2025-03-15 00:51:59,750 WARN L1702 CHandler]: Possible shadowing of function new [2025-03-15 00:51:59,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:51:59,847 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:51:59,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59 WrapperNode [2025-03-15 00:51:59,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:51:59,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:51:59,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:51:59,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:51:59,855 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:51:59" (1/1) ... [2025-03-15 00:51:59,882 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:51:59" (1/1) ... [2025-03-15 00:51:59,914 INFO L138 Inliner]: procedures = 280, calls = 143, calls flagged for inlining = 11, calls inlined = 12, statements flattened = 526 [2025-03-15 00:51:59,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:51:59,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:51:59,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:51:59,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:51:59,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:51:59,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:52:00,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:52:00,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:52:00,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:52:00,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:52:00,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (1/1) ... [2025-03-15 00:52:00,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:52:00,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:52:00,035 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:52:00,038 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:52:00,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-03-15 00:52:00,055 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-15 00:52:00,055 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:52:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:52:00,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:52:00,056 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:52:00,159 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:52:00,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:52:00,907 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:52:00,908 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:52:00,959 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:52:00,959 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-03-15 00:52:00,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:52:00 BoogieIcfgContainer [2025-03-15 00:52:00,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:52:00,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:52:00,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:52:00,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:52:00,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:51:59" (1/3) ... [2025-03-15 00:52:00,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43876cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:52:00, skipping insertion in model container [2025-03-15 00:52:00,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:51:59" (2/3) ... [2025-03-15 00:52:00,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43876cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:52:00, skipping insertion in model container [2025-03-15 00:52:00,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:52:00" (3/3) ... [2025-03-15 00:52:00,967 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_90-arrayloop2_racing.i [2025-03-15 00:52:00,976 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:52:00,978 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_90-arrayloop2_racing.i that has 3 procedures, 546 locations, 1 initial locations, 20 loop locations, and 28 error locations. [2025-03-15 00:52:00,978 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:52:01,101 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 00:52:01,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:52:01,198 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;@402f6f5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:52:01,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-15 00:52:01,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:52:01,253 INFO L124 PetriNetUnfolderBase]: 0/118 cut-off events. [2025-03-15 00:52:01,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:52:01,255 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:01,256 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] [2025-03-15 00:52:01,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-15 00:52:01,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:01,262 INFO L85 PathProgramCache]: Analyzing trace with hash 426517698, now seen corresponding path program 1 times [2025-03-15 00:52:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294068318] [2025-03-15 00:52:01,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:01,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:02,244 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:52:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:02,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294068318] [2025-03-15 00:52:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294068318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:02,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:52:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928861708] [2025-03-15 00:52:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:02,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:52:02,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:02,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:52:02,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:52:02,284 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 585 [2025-03-15 00:52:02,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 585 transitions, 1190 flow. Second operand has 6 states, 6 states have (on average 354.5) internal successors, (2127), 6 states have internal predecessors, (2127), 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:52:02,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:02,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 585 [2025-03-15 00:52:02,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:28,148 INFO L124 PetriNetUnfolderBase]: 106298/220503 cut-off events. [2025-03-15 00:52:28,149 INFO L125 PetriNetUnfolderBase]: For 1439/1769 co-relation queries the response was YES. [2025-03-15 00:52:28,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378134 conditions, 220503 events. 106298/220503 cut-off events. For 1439/1769 co-relation queries the response was YES. Maximal size of possible extension queue 3998. Compared 2610435 event pairs, 96650 based on Foata normal form. 22228/212660 useless extension candidates. Maximal degree in co-relation 371566. Up to 157096 conditions per place. [2025-03-15 00:52:29,686 INFO L140 encePairwiseOnDemand]: 547/585 looper letters, 192 selfloop transitions, 10 changer transitions 0/553 dead transitions. [2025-03-15 00:52:29,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 553 transitions, 1530 flow [2025-03-15 00:52:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:52:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:52:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2348 transitions. [2025-03-15 00:52:29,701 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6689458689458689 [2025-03-15 00:52:29,703 INFO L298 CegarLoopForPetriNet]: 552 programPoint places, -1 predicate places. [2025-03-15 00:52:29,703 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 553 transitions, 1530 flow [2025-03-15 00:52:29,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 354.5) internal successors, (2127), 6 states have internal predecessors, (2127), 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:52:29,705 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:29,705 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] [2025-03-15 00:52:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:52:29,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-15 00:52:29,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash -502541822, now seen corresponding path program 1 times [2025-03-15 00:52:29,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183582459] [2025-03-15 00:52:29,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:29,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:29,812 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:52:29,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:29,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183582459] [2025-03-15 00:52:29,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183582459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:29,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:29,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:52:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879567812] [2025-03-15 00:52:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:29,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:29,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:29,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:29,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:29,817 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 585 [2025-03-15 00:52:29,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 553 transitions, 1530 flow. Second operand has 3 states, 3 states have (on average 524.3333333333334) internal successors, (1573), 3 states have internal predecessors, (1573), 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:52:29,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:29,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 585 [2025-03-15 00:52:29,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:56,062 INFO L124 PetriNetUnfolderBase]: 109626/229866 cut-off events. [2025-03-15 00:52:56,063 INFO L125 PetriNetUnfolderBase]: For 25810/27150 co-relation queries the response was YES. [2025-03-15 00:52:56,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417993 conditions, 229866 events. 109626/229866 cut-off events. For 25810/27150 co-relation queries the response was YES. Maximal size of possible extension queue 4218. Compared 2763914 event pairs, 99473 based on Foata normal form. 0/198634 useless extension candidates. Maximal degree in co-relation 410601. Up to 162780 conditions per place. [2025-03-15 00:52:57,773 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 39 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-03-15 00:52:57,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 560 transitions, 1626 flow [2025-03-15 00:52:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1611 transitions. [2025-03-15 00:52:57,780 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9179487179487179 [2025-03-15 00:52:57,782 INFO L298 CegarLoopForPetriNet]: 552 programPoint places, 1 predicate places. [2025-03-15 00:52:57,782 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 560 transitions, 1626 flow [2025-03-15 00:52:57,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 524.3333333333334) internal successors, (1573), 3 states have internal predecessors, (1573), 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:52:57,783 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:57,784 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] [2025-03-15 00:52:57,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:52:57,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-15 00:52:57,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash 338969713, now seen corresponding path program 1 times [2025-03-15 00:52:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629712324] [2025-03-15 00:52:57,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:58,200 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:52:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629712324] [2025-03-15 00:52:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629712324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:58,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:52:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589372560] [2025-03-15 00:52:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:58,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:52:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:58,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:52:58,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:52:58,204 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 585 [2025-03-15 00:52:58,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 560 transitions, 1626 flow. Second operand has 6 states, 6 states have (on average 355.5) internal successors, (2133), 6 states have internal predecessors, (2133), 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:52:58,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:58,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 585 [2025-03-15 00:52:58,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:26,468 INFO L124 PetriNetUnfolderBase]: 109626/229862 cut-off events. [2025-03-15 00:53:26,469 INFO L125 PetriNetUnfolderBase]: For 60760/113868 co-relation queries the response was YES. [2025-03-15 00:53:27,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580781 conditions, 229862 events. 109626/229862 cut-off events. For 60760/113868 co-relation queries the response was YES. Maximal size of possible extension queue 4218. Compared 2763995 event pairs, 99473 based on Foata normal form. 0/198634 useless extension candidates. Maximal degree in co-relation 570879. Up to 162776 conditions per place. [2025-03-15 00:53:28,216 INFO L140 encePairwiseOnDemand]: 573/585 looper letters, 190 selfloop transitions, 10 changer transitions 0/558 dead transitions. [2025-03-15 00:53:28,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 558 transitions, 2018 flow [2025-03-15 00:53:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:53:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:53:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2320 transitions. [2025-03-15 00:53:28,222 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6609686609686609 [2025-03-15 00:53:28,223 INFO L298 CegarLoopForPetriNet]: 552 programPoint places, 4 predicate places. [2025-03-15 00:53:28,223 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 558 transitions, 2018 flow [2025-03-15 00:53:28,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 355.5) internal successors, (2133), 6 states have internal predecessors, (2133), 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:53:28,225 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:28,225 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] [2025-03-15 00:53:28,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:53:28,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-15 00:53:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1041035292, now seen corresponding path program 1 times [2025-03-15 00:53:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:28,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364319916] [2025-03-15 00:53:28,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:28,877 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:53:28,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364319916] [2025-03-15 00:53:28,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364319916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:28,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:28,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:53:28,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950930816] [2025-03-15 00:53:28,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:28,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:53:28,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:28,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:53:28,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:53:28,882 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 585 [2025-03-15 00:53:28,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 558 transitions, 2018 flow. Second operand has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 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:53:28,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:28,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 585 [2025-03-15 00:53:28,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:58,341 INFO L124 PetriNetUnfolderBase]: 109626/229860 cut-off events. [2025-03-15 00:53:58,341 INFO L125 PetriNetUnfolderBase]: For 117402/222278 co-relation queries the response was YES. [2025-03-15 00:53:58,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743557 conditions, 229860 events. 109626/229860 cut-off events. For 117402/222278 co-relation queries the response was YES. Maximal size of possible extension queue 4218. Compared 2763372 event pairs, 99473 based on Foata normal form. 0/198634 useless extension candidates. Maximal degree in co-relation 731157. Up to 162774 conditions per place. [2025-03-15 00:54:00,378 INFO L140 encePairwiseOnDemand]: 579/585 looper letters, 188 selfloop transitions, 5 changer transitions 0/557 dead transitions. [2025-03-15 00:54:00,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 557 transitions, 2398 flow [2025-03-15 00:54:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:54:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:54:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2348 transitions. [2025-03-15 00:54:00,382 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6689458689458689 [2025-03-15 00:54:00,383 INFO L298 CegarLoopForPetriNet]: 552 programPoint places, 8 predicate places. [2025-03-15 00:54:00,383 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 557 transitions, 2398 flow [2025-03-15 00:54:00,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 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:54:00,384 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:00,384 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] [2025-03-15 00:54:00,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:54:00,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-15 00:54:00,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1527988128, now seen corresponding path program 1 times [2025-03-15 00:54:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:00,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600328426] [2025-03-15 00:54:00,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:00,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:54:00,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:00,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600328426] [2025-03-15 00:54:00,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600328426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:00,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:54:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778058957] [2025-03-15 00:54:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:00,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:00,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:00,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:00,446 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 585 [2025-03-15 00:54:00,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 557 transitions, 2398 flow. Second operand has 3 states, 3 states have (on average 527.3333333333334) internal successors, (1582), 3 states have internal predecessors, (1582), 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:54:00,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:00,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 585 [2025-03-15 00:54:00,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:35,972 INFO L124 PetriNetUnfolderBase]: 109626/230048 cut-off events. [2025-03-15 00:54:35,973 INFO L125 PetriNetUnfolderBase]: For 280422/386333 co-relation queries the response was YES. [2025-03-15 00:54:36,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768870 conditions, 230048 events. 109626/230048 cut-off events. For 280422/386333 co-relation queries the response was YES. Maximal size of possible extension queue 4219. Compared 2766608 event pairs, 99473 based on Foata normal form. 0/198812 useless extension candidates. Maximal degree in co-relation 755510. Up to 162868 conditions per place. [2025-03-15 00:54:38,348 INFO L140 encePairwiseOnDemand]: 582/585 looper letters, 35 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2025-03-15 00:54:38,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 562 transitions, 2486 flow [2025-03-15 00:54:38,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1614 transitions. [2025-03-15 00:54:38,358 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9196581196581196 [2025-03-15 00:54:38,359 INFO L298 CegarLoopForPetriNet]: 552 programPoint places, 10 predicate places. [2025-03-15 00:54:38,359 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 562 transitions, 2486 flow [2025-03-15 00:54:38,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 527.3333333333334) internal successors, (1582), 3 states have internal predecessors, (1582), 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:54:38,365 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:38,365 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:54:38,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:54:38,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-15 00:54:38,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash 99026212, now seen corresponding path program 1 times [2025-03-15 00:54:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776791017] [2025-03-15 00:54:38,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:39,293 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:54:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776791017] [2025-03-15 00:54:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776791017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:39,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:54:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174000541] [2025-03-15 00:54:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:39,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:54:39,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:39,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:54:39,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:54:39,297 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 585 [2025-03-15 00:54:39,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 562 transitions, 2486 flow. Second operand has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 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:54:39,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:39,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 585 [2025-03-15 00:54:39,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand