/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/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:52:45,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:52:45,750 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:52:45,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:52:45,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:52:45,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:52:45,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:52:45,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:52:45,778 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:52:45,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:52:45,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:52:45,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:52:45,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:52:45,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:52:45,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:52:45,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:52:45,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:52:45,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:52:45,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:52:45,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:52:45,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:52:45,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:52:45,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:52:45,781 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:52:45,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:52:45,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:52:45,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:52:45,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:52:45,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:52:45,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:52:45,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:52:45,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:52:45,782 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:52:46,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:52:46,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:52:46,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:52:46,029 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:52:46,029 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:52:46,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-15 00:52:47,194 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e810d501/1234b41a7b7e45c48cbb24064fc691d6/FLAG29b22f777 [2025-03-15 00:52:47,418 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:52:47,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-15 00:52:47,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e810d501/1234b41a7b7e45c48cbb24064fc691d6/FLAG29b22f777 [2025-03-15 00:52:47,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e810d501/1234b41a7b7e45c48cbb24064fc691d6 [2025-03-15 00:52:47,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:52:47,757 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:52:47,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:52:47,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:52:47,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:52:47,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:52:47" (1/1) ... [2025-03-15 00:52:47,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726adcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:47, skipping insertion in model container [2025-03-15 00:52:47,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:52:47" (1/1) ... [2025-03-15 00:52:47,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:52:48,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:52:48,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:52:48,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:52:48,124 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:52:48,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48 WrapperNode [2025-03-15 00:52:48,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:52:48,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:52:48,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:52:48,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:52:48,130 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:52:48" (1/1) ... [2025-03-15 00:52:48,140 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:52:48" (1/1) ... [2025-03-15 00:52:48,165 INFO L138 Inliner]: procedures = 165, calls = 47, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 198 [2025-03-15 00:52:48,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:52:48,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:52:48,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:52:48,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:52:48,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,182 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:52:48,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:52:48,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:52:48,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:52:48,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (1/1) ... [2025-03-15 00:52:48,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:52:48,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:52:48,232 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:48,234 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:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:52:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:52:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:52:48,255 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:52:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:52:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:52:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:52:48,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:52:48,256 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:48,360 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:52:48,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:52:48,680 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:52:48,680 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:52:48,720 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:52:48,720 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:52:48,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:52:48 BoogieIcfgContainer [2025-03-15 00:52:48,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:52:48,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:52:48,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:52:48,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:52:48,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:52:47" (1/3) ... [2025-03-15 00:52:48,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596cb4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:52:48, skipping insertion in model container [2025-03-15 00:52:48,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:48" (2/3) ... [2025-03-15 00:52:48,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596cb4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:52:48, skipping insertion in model container [2025-03-15 00:52:48,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:52:48" (3/3) ... [2025-03-15 00:52:48,730 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-15 00:52:48,742 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:52:48,743 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i that has 2 procedures, 226 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-03-15 00:52:48,744 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:52:48,836 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:52:48,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:52:48,876 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;@1aa20268, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:52:48,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-15 00:52:48,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:52:48,910 INFO L124 PetriNetUnfolderBase]: 0/65 cut-off events. [2025-03-15 00:52:48,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:52:48,912 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:48,912 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] [2025-03-15 00:52:48,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:48,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2069921328, now seen corresponding path program 1 times [2025-03-15 00:52:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603128662] [2025-03-15 00:52:48,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:49,103 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:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603128662] [2025-03-15 00:52:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603128662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:49,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329875619] [2025-03-15 00:52:49,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:49,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:49,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:49,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:49,144 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 237 [2025-03-15 00:52:49,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 237 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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:49,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:49,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 237 [2025-03-15 00:52:49,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:49,491 INFO L124 PetriNetUnfolderBase]: 214/1444 cut-off events. [2025-03-15 00:52:49,491 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:52:49,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 1444 events. 214/1444 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8768 event pairs, 157 based on Foata normal form. 117/1375 useless extension candidates. Maximal degree in co-relation 1854. Up to 407 conditions per place. [2025-03-15 00:52:49,508 INFO L140 encePairwiseOnDemand]: 221/237 looper letters, 40 selfloop transitions, 5 changer transitions 1/234 dead transitions. [2025-03-15 00:52:49,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 234 transitions, 561 flow [2025-03-15 00:52:49,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 643 transitions. [2025-03-15 00:52:49,525 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9043600562587905 [2025-03-15 00:52:49,528 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, -5 predicate places. [2025-03-15 00:52:49,528 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 234 transitions, 561 flow [2025-03-15 00:52:49,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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:49,529 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:49,529 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] [2025-03-15 00:52:49,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:52:49,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:49,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash 211532478, now seen corresponding path program 1 times [2025-03-15 00:52:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:49,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890687625] [2025-03-15 00:52:49,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:49,630 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:49,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:49,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890687625] [2025-03-15 00:52:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890687625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:49,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:49,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:49,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964109062] [2025-03-15 00:52:49,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:49,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:49,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:49,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:49,634 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 237 [2025-03-15 00:52:49,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 234 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 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:49,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:49,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 237 [2025-03-15 00:52:49,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:49,943 INFO L124 PetriNetUnfolderBase]: 296/1999 cut-off events. [2025-03-15 00:52:49,944 INFO L125 PetriNetUnfolderBase]: For 243/279 co-relation queries the response was YES. [2025-03-15 00:52:49,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 1999 events. 296/1999 cut-off events. For 243/279 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 13424 event pairs, 226 based on Foata normal form. 1/1743 useless extension candidates. Maximal degree in co-relation 2901. Up to 499 conditions per place. [2025-03-15 00:52:49,956 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 38 selfloop transitions, 4 changer transitions 1/245 dead transitions. [2025-03-15 00:52:49,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 245 transitions, 679 flow [2025-03-15 00:52:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 634 transitions. [2025-03-15 00:52:49,960 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8917018284106891 [2025-03-15 00:52:49,961 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, -3 predicate places. [2025-03-15 00:52:49,961 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 245 transitions, 679 flow [2025-03-15 00:52:49,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 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:49,962 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:49,962 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:49,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:52:49,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:49,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1938240668, now seen corresponding path program 1 times [2025-03-15 00:52:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:49,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575550510] [2025-03-15 00:52:49,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:50,022 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:50,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:50,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575550510] [2025-03-15 00:52:50,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575550510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:50,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:50,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829686169] [2025-03-15 00:52:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:50,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:50,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:50,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:50,024 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 237 [2025-03-15 00:52:50,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 245 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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:50,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:50,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 237 [2025-03-15 00:52:50,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:50,337 INFO L124 PetriNetUnfolderBase]: 403/2724 cut-off events. [2025-03-15 00:52:50,337 INFO L125 PetriNetUnfolderBase]: For 983/1136 co-relation queries the response was YES. [2025-03-15 00:52:50,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4541 conditions, 2724 events. 403/2724 cut-off events. For 983/1136 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 21141 event pairs, 173 based on Foata normal form. 7/2413 useless extension candidates. Maximal degree in co-relation 4480. Up to 733 conditions per place. [2025-03-15 00:52:50,346 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 52 selfloop transitions, 5 changer transitions 1/265 dead transitions. [2025-03-15 00:52:50,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 265 transitions, 905 flow [2025-03-15 00:52:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-03-15 00:52:50,348 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9085794655414908 [2025-03-15 00:52:50,349 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, -1 predicate places. [2025-03-15 00:52:50,349 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 265 transitions, 905 flow [2025-03-15 00:52:50,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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:50,349 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:50,349 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] [2025-03-15 00:52:50,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:52:50,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:50,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash -586780389, now seen corresponding path program 1 times [2025-03-15 00:52:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557157439] [2025-03-15 00:52:50,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:50,404 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:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:50,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557157439] [2025-03-15 00:52:50,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557157439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:50,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:50,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823297809] [2025-03-15 00:52:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:50,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:50,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:50,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:50,409 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 237 [2025-03-15 00:52:50,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 265 transitions, 905 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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:50,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:50,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 237 [2025-03-15 00:52:50,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:51,014 INFO L124 PetriNetUnfolderBase]: 805/5112 cut-off events. [2025-03-15 00:52:51,014 INFO L125 PetriNetUnfolderBase]: For 4200/4470 co-relation queries the response was YES. [2025-03-15 00:52:51,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9471 conditions, 5112 events. 805/5112 cut-off events. For 4200/4470 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 47876 event pairs, 280 based on Foata normal form. 24/4517 useless extension candidates. Maximal degree in co-relation 9408. Up to 1402 conditions per place. [2025-03-15 00:52:51,037 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 77 selfloop transitions, 4 changer transitions 1/294 dead transitions. [2025-03-15 00:52:51,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 294 transitions, 1257 flow [2025-03-15 00:52:51,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2025-03-15 00:52:51,039 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9057665260196905 [2025-03-15 00:52:51,040 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 1 predicate places. [2025-03-15 00:52:51,040 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 294 transitions, 1257 flow [2025-03-15 00:52:51,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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:51,040 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:51,040 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] [2025-03-15 00:52:51,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:52:51,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:51,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash 424464038, now seen corresponding path program 1 times [2025-03-15 00:52:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:51,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875258330] [2025-03-15 00:52:51,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:51,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:51,339 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:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875258330] [2025-03-15 00:52:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875258330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:51,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:51,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 00:52:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797464598] [2025-03-15 00:52:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:51,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:52:51,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:51,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:52:51,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:52:51,342 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 237 [2025-03-15 00:52:51,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 294 transitions, 1257 flow. Second operand has 6 states, 6 states have (on average 199.83333333333334) internal successors, (1199), 6 states have internal predecessors, (1199), 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:51,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:51,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 237 [2025-03-15 00:52:51,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:51,659 INFO L124 PetriNetUnfolderBase]: 413/2438 cut-off events. [2025-03-15 00:52:51,659 INFO L125 PetriNetUnfolderBase]: For 3716/3902 co-relation queries the response was YES. [2025-03-15 00:52:51,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 2438 events. 413/2438 cut-off events. For 3716/3902 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 18457 event pairs, 210 based on Foata normal form. 33/2180 useless extension candidates. Maximal degree in co-relation 5062. Up to 789 conditions per place. [2025-03-15 00:52:51,669 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 56 selfloop transitions, 20 changer transitions 1/277 dead transitions. [2025-03-15 00:52:51,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 277 transitions, 1317 flow [2025-03-15 00:52:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:52:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:52:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1026 transitions. [2025-03-15 00:52:51,672 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8658227848101265 [2025-03-15 00:52:51,673 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 2 predicate places. [2025-03-15 00:52:51,673 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 277 transitions, 1317 flow [2025-03-15 00:52:51,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.83333333333334) internal successors, (1199), 6 states have internal predecessors, (1199), 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:51,674 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:51,674 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] [2025-03-15 00:52:51,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:52:51,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:51,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1761699075, now seen corresponding path program 1 times [2025-03-15 00:52:51,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:51,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895899503] [2025-03-15 00:52:51,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:51,736 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:51,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895899503] [2025-03-15 00:52:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895899503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:51,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785092084] [2025-03-15 00:52:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:51,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:51,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:51,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:51,737 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 237 [2025-03-15 00:52:51,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 277 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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:51,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:51,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 237 [2025-03-15 00:52:51,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:51,957 INFO L124 PetriNetUnfolderBase]: 421/2440 cut-off events. [2025-03-15 00:52:51,957 INFO L125 PetriNetUnfolderBase]: For 5114/5332 co-relation queries the response was YES. [2025-03-15 00:52:51,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5723 conditions, 2440 events. 421/2440 cut-off events. For 5114/5332 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 18393 event pairs, 204 based on Foata normal form. 1/2158 useless extension candidates. Maximal degree in co-relation 5642. Up to 797 conditions per place. [2025-03-15 00:52:51,966 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 78 selfloop transitions, 3 changer transitions 1/280 dead transitions. [2025-03-15 00:52:51,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 280 transitions, 1523 flow [2025-03-15 00:52:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-03-15 00:52:51,968 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.869198312236287 [2025-03-15 00:52:51,968 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 3 predicate places. [2025-03-15 00:52:51,968 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 280 transitions, 1523 flow [2025-03-15 00:52:51,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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:51,969 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:51,969 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] [2025-03-15 00:52:51,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:52:51,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:51,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash 85735142, now seen corresponding path program 1 times [2025-03-15 00:52:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178722189] [2025-03-15 00:52:51,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:52,020 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:52,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:52,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178722189] [2025-03-15 00:52:52,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178722189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:52,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:52,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398168837] [2025-03-15 00:52:52,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:52,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:52,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:52,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:52,022 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 237 [2025-03-15 00:52:52,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 280 transitions, 1523 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 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:52,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:52,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 237 [2025-03-15 00:52:52,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:52,331 INFO L124 PetriNetUnfolderBase]: 428/2433 cut-off events. [2025-03-15 00:52:52,331 INFO L125 PetriNetUnfolderBase]: For 7146/7483 co-relation queries the response was YES. [2025-03-15 00:52:52,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6292 conditions, 2433 events. 428/2433 cut-off events. For 7146/7483 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 18270 event pairs, 206 based on Foata normal form. 5/2174 useless extension candidates. Maximal degree in co-relation 6207. Up to 804 conditions per place. [2025-03-15 00:52:52,347 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 84 selfloop transitions, 3 changer transitions 1/286 dead transitions. [2025-03-15 00:52:52,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 286 transitions, 1789 flow [2025-03-15 00:52:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2025-03-15 00:52:52,349 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8677918424753868 [2025-03-15 00:52:52,351 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 4 predicate places. [2025-03-15 00:52:52,351 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 286 transitions, 1789 flow [2025-03-15 00:52:52,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 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:52,351 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:52,352 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] [2025-03-15 00:52:52,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:52:52,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:52,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1634830210, now seen corresponding path program 1 times [2025-03-15 00:52:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:52,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390896213] [2025-03-15 00:52:52,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:52,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:52,410 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:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:52,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390896213] [2025-03-15 00:52:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390896213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:52,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:52,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403627878] [2025-03-15 00:52:52,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:52,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:52,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:52,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:52,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:52,414 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 237 [2025-03-15 00:52:52,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 286 transitions, 1789 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 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:52,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:52,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 237 [2025-03-15 00:52:52,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:52,753 INFO L124 PetriNetUnfolderBase]: 521/2658 cut-off events. [2025-03-15 00:52:52,753 INFO L125 PetriNetUnfolderBase]: For 10532/11395 co-relation queries the response was YES. [2025-03-15 00:52:52,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7823 conditions, 2658 events. 521/2658 cut-off events. For 10532/11395 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 20185 event pairs, 207 based on Foata normal form. 4/2368 useless extension candidates. Maximal degree in co-relation 7734. Up to 912 conditions per place. [2025-03-15 00:52:52,764 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 79 selfloop transitions, 5 changer transitions 36/306 dead transitions. [2025-03-15 00:52:52,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 306 transitions, 2247 flow [2025-03-15 00:52:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 625 transitions. [2025-03-15 00:52:52,767 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8790436005625879 [2025-03-15 00:52:52,769 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 6 predicate places. [2025-03-15 00:52:52,769 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 306 transitions, 2247 flow [2025-03-15 00:52:52,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 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:52,769 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:52,769 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] [2025-03-15 00:52:52,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:52:52,770 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:52,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:52,770 INFO L85 PathProgramCache]: Analyzing trace with hash -238349530, now seen corresponding path program 1 times [2025-03-15 00:52:52,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:52,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989921572] [2025-03-15 00:52:52,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:52,830 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:52,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989921572] [2025-03-15 00:52:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989921572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:52,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:52,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:52,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630355093] [2025-03-15 00:52:52,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:52,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:52,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:52,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:52,832 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 237 [2025-03-15 00:52:52,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 306 transitions, 2247 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 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:52,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:52,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 237 [2025-03-15 00:52:52,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:53,221 INFO L124 PetriNetUnfolderBase]: 587/2966 cut-off events. [2025-03-15 00:52:53,221 INFO L125 PetriNetUnfolderBase]: For 14747/15884 co-relation queries the response was YES. [2025-03-15 00:52:53,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9628 conditions, 2966 events. 587/2966 cut-off events. For 14747/15884 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 22904 event pairs, 196 based on Foata normal form. 6/2708 useless extension candidates. Maximal degree in co-relation 9537. Up to 972 conditions per place. [2025-03-15 00:52:53,236 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 100 selfloop transitions, 9 changer transitions 36/334 dead transitions. [2025-03-15 00:52:53,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 334 transitions, 2889 flow [2025-03-15 00:52:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2025-03-15 00:52:53,237 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8874824191279888 [2025-03-15 00:52:53,238 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 8 predicate places. [2025-03-15 00:52:53,238 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 334 transitions, 2889 flow [2025-03-15 00:52:53,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 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:53,238 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:53,238 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] [2025-03-15 00:52:53,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:52:53,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:53,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash 594234345, now seen corresponding path program 1 times [2025-03-15 00:52:53,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:53,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832153219] [2025-03-15 00:52:53,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:53,278 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:53,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832153219] [2025-03-15 00:52:53,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832153219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:53,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:53,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745281621] [2025-03-15 00:52:53,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:53,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:53,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:53,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:53,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:53,281 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 237 [2025-03-15 00:52:53,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 334 transitions, 2889 flow. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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:53,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:53,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 237 [2025-03-15 00:52:53,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:53,667 INFO L124 PetriNetUnfolderBase]: 646/3537 cut-off events. [2025-03-15 00:52:53,667 INFO L125 PetriNetUnfolderBase]: For 21853/23414 co-relation queries the response was YES. [2025-03-15 00:52:53,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12338 conditions, 3537 events. 646/3537 cut-off events. For 21853/23414 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 29455 event pairs, 166 based on Foata normal form. 15/3287 useless extension candidates. Maximal degree in co-relation 12245. Up to 1082 conditions per place. [2025-03-15 00:52:53,680 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 109 selfloop transitions, 5 changer transitions 85/390 dead transitions. [2025-03-15 00:52:53,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 390 transitions, 4269 flow [2025-03-15 00:52:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-15 00:52:53,682 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8945147679324894 [2025-03-15 00:52:53,683 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 10 predicate places. [2025-03-15 00:52:53,683 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 390 transitions, 4269 flow [2025-03-15 00:52:53,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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:53,683 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:53,683 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] [2025-03-15 00:52:53,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:52:53,683 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:53,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash 721554564, now seen corresponding path program 1 times [2025-03-15 00:52:53,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:53,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106057154] [2025-03-15 00:52:53,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:53,828 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:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106057154] [2025-03-15 00:52:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106057154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:53,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:53,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:52:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522707713] [2025-03-15 00:52:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:53,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 00:52:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:53,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 00:52:53,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 00:52:53,829 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 237 [2025-03-15 00:52:53,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 390 transitions, 4269 flow. Second operand has 5 states, 5 states have (on average 200.8) internal successors, (1004), 5 states have internal predecessors, (1004), 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:53,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:53,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 237 [2025-03-15 00:52:53,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:54,158 INFO L124 PetriNetUnfolderBase]: 506/2943 cut-off events. [2025-03-15 00:52:54,158 INFO L125 PetriNetUnfolderBase]: For 22840/24291 co-relation queries the response was YES. [2025-03-15 00:52:54,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10454 conditions, 2943 events. 506/2943 cut-off events. For 22840/24291 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 23297 event pairs, 124 based on Foata normal form. 20/2749 useless extension candidates. Maximal degree in co-relation 10347. Up to 840 conditions per place. [2025-03-15 00:52:54,166 INFO L140 encePairwiseOnDemand]: 229/237 looper letters, 54 selfloop transitions, 21 changer transitions 97/386 dead transitions. [2025-03-15 00:52:54,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 386 transitions, 4509 flow [2025-03-15 00:52:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:52:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:52:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1026 transitions. [2025-03-15 00:52:54,169 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8658227848101265 [2025-03-15 00:52:54,169 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 14 predicate places. [2025-03-15 00:52:54,169 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 386 transitions, 4509 flow [2025-03-15 00:52:54,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 200.8) internal successors, (1004), 5 states have internal predecessors, (1004), 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:54,170 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:54,170 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] [2025-03-15 00:52:54,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:52:54,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:54,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash -936498910, now seen corresponding path program 2 times [2025-03-15 00:52:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:54,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812576573] [2025-03-15 00:52:54,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:52:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:54,185 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:52:54,185 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:52:54,415 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:54,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:54,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812576573] [2025-03-15 00:52:54,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812576573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:54,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 00:52:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243732419] [2025-03-15 00:52:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:54,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:52:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:54,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:52:54,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:52:54,416 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 237 [2025-03-15 00:52:54,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 386 transitions, 4509 flow. Second operand has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 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:54,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:54,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 237 [2025-03-15 00:52:54,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:54,654 INFO L124 PetriNetUnfolderBase]: 239/1713 cut-off events. [2025-03-15 00:52:54,654 INFO L125 PetriNetUnfolderBase]: For 14508/15299 co-relation queries the response was YES. [2025-03-15 00:52:54,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6021 conditions, 1713 events. 239/1713 cut-off events. For 14508/15299 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 11019 event pairs, 64 based on Foata normal form. 19/1615 useless extension candidates. Maximal degree in co-relation 5900. Up to 443 conditions per place. [2025-03-15 00:52:54,662 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 44 selfloop transitions, 11 changer transitions 71/321 dead transitions. [2025-03-15 00:52:54,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 321 transitions, 3427 flow [2025-03-15 00:52:54,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:52:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:52:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1024 transitions. [2025-03-15 00:52:54,666 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8641350210970464 [2025-03-15 00:52:54,666 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 17 predicate places. [2025-03-15 00:52:54,667 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 321 transitions, 3427 flow [2025-03-15 00:52:54,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 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:54,668 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:54,668 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] [2025-03-15 00:52:54,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:52:54,668 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-15 00:52:54,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash 945495610, now seen corresponding path program 1 times [2025-03-15 00:52:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:54,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394889889] [2025-03-15 00:52:54,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:54,973 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:54,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394889889] [2025-03-15 00:52:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394889889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:54,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 00:52:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621128506] [2025-03-15 00:52:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:54,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 00:52:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:54,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 00:52:54,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 00:52:54,975 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 237 [2025-03-15 00:52:54,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 321 transitions, 3427 flow. Second operand has 7 states, 7 states have (on average 195.28571428571428) internal successors, (1367), 7 states have internal predecessors, (1367), 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:54,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:54,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 237 [2025-03-15 00:52:54,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:55,115 INFO L124 PetriNetUnfolderBase]: 75/950 cut-off events. [2025-03-15 00:52:55,116 INFO L125 PetriNetUnfolderBase]: For 9027/9315 co-relation queries the response was YES. [2025-03-15 00:52:55,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 950 events. 75/950 cut-off events. For 9027/9315 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4548 event pairs, 27 based on Foata normal form. 27/932 useless extension candidates. Maximal degree in co-relation 3031. Up to 186 conditions per place. [2025-03-15 00:52:55,117 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 0 selfloop transitions, 0 changer transitions 264/264 dead transitions. [2025-03-15 00:52:55,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 264 transitions, 2489 flow [2025-03-15 00:52:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:52:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:52:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1187 transitions. [2025-03-15 00:52:55,120 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8347398030942335 [2025-03-15 00:52:55,120 INFO L298 CegarLoopForPetriNet]: 229 programPoint places, 19 predicate places. [2025-03-15 00:52:55,120 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 264 transitions, 2489 flow [2025-03-15 00:52:55,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 195.28571428571428) internal successors, (1367), 7 states have internal predecessors, (1367), 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:55,127 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i_petrified1_AllErrorsAtOnce [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-15 00:52:55,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-15 00:52:55,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:52:55,151 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:55,154 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:52:55,154 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:52:55,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:52:55 BasicIcfg [2025-03-15 00:52:55,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:52:55,158 INFO L158 Benchmark]: Toolchain (without parser) took 7400.25ms. Allocated memory was 71.3MB in the beginning and 541.1MB in the end (delta: 469.8MB). Free memory was 43.1MB in the beginning and 360.1MB in the end (delta: -317.0MB). Peak memory consumption was 151.2MB. Max. memory is 8.0GB. [2025-03-15 00:52:55,158 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 71.3MB. Free memory is still 33.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:52:55,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.81ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 22.2MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 00:52:55,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.76ms. Allocated memory is still 71.3MB. Free memory was 22.1MB in the beginning and 19.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:52:55,158 INFO L158 Benchmark]: Boogie Preprocessor took 30.07ms. Allocated memory is still 71.3MB. Free memory was 19.9MB in the beginning and 18.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:52:55,158 INFO L158 Benchmark]: RCFGBuilder took 525.85ms. Allocated memory is still 71.3MB. Free memory was 18.5MB in the beginning and 22.6MB in the end (delta: -4.1MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2025-03-15 00:52:55,158 INFO L158 Benchmark]: TraceAbstraction took 6432.83ms. Allocated memory was 71.3MB in the beginning and 541.1MB in the end (delta: 469.8MB). Free memory was 21.3MB in the beginning and 360.1MB in the end (delta: -338.8MB). Peak memory consumption was 135.9MB. Max. memory is 8.0GB. [2025-03-15 00:52:55,159 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 71.3MB. Free memory is still 33.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 366.81ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 22.2MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.76ms. Allocated memory is still 71.3MB. Free memory was 22.1MB in the beginning and 19.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.07ms. Allocated memory is still 71.3MB. Free memory was 19.9MB in the beginning and 18.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 525.85ms. Allocated memory is still 71.3MB. Free memory was 18.5MB in the beginning and 22.6MB in the end (delta: -4.1MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * TraceAbstraction took 6432.83ms. Allocated memory was 71.3MB in the beginning and 541.1MB in the end (delta: 469.8MB). Free memory was 21.3MB in the beginning and 360.1MB in the end (delta: -338.8MB). Peak memory consumption was 135.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 737]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 738]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 739]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 742]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 746]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 716]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 717]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 722]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 723]: 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 3 procedures, 332 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 760 IncrementalHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 113 mSDtfsCounter, 760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4509occurred in iteration=11, InterpolantAutomatonStates: 48, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1219 NumberOfCodeBlocks, 1219 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1206 ConstructedInterpolants, 0 QuantifiedInterpolants, 3652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:52:55,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...