/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/06-symbeq_05-funloop_hard2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:25:46,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:25:46,747 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:25:46,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:25:46,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:25:46,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:25:46,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:25:46,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:25:46,775 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:25:46,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:25:46,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:25:46,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:25:46,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:25:46,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:25:46,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:25:46,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:25:46,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:46,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:25:46,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:25:46,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:25:46,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:25:46,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:25:46,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:25:46,778 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:25:47,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:25:47,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:25:47,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:25:47,029 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:25:47,029 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:25:47,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2025-03-15 00:25:48,227 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b71a99b/baefef000ba048eaae7737eb30692b89/FLAG76d396480 [2025-03-15 00:25:48,434 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:25:48,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2025-03-15 00:25:48,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b71a99b/baefef000ba048eaae7737eb30692b89/FLAG76d396480 [2025-03-15 00:25:48,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b71a99b/baefef000ba048eaae7737eb30692b89 [2025-03-15 00:25:48,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:25:48,459 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:25:48,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:48,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:25:48,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:25:48,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:48,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18814707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48, skipping insertion in model container [2025-03-15 00:25:48,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:48,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:25:48,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:48,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:25:48,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:48,926 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:25:48,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48 WrapperNode [2025-03-15 00:25:48,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:48,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:48,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:25:48,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:25:48,932 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:25:48" (1/1) ... [2025-03-15 00:25:48,951 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:25:48" (1/1) ... [2025-03-15 00:25:48,979 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2025-03-15 00:25:48,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:48,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:25:48,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:25:48,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:25:48,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:48,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:48,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:48,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:48,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:49,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:49,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:49,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:49,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:49,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:25:49,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:25:49,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:25:49,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:25:49,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (1/1) ... [2025-03-15 00:25:49,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:49,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:49,047 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:25:49,050 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:25:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:25:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:25:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:25:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:25:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:25:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:25:49,068 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:25:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:25:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:25:49,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:25:49,069 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:25:49,154 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:25:49,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:25:49,432 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:25:49,432 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:25:49,450 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:25:49,451 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:25:49,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:49 BoogieIcfgContainer [2025-03-15 00:25:49,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:25:49,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:25:49,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:25:49,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:25:49,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:25:48" (1/3) ... [2025-03-15 00:25:49,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18001b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:49, skipping insertion in model container [2025-03-15 00:25:49,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:48" (2/3) ... [2025-03-15 00:25:49,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18001b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:49, skipping insertion in model container [2025-03-15 00:25:49,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:49" (3/3) ... [2025-03-15 00:25:49,459 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2025-03-15 00:25:49,470 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:25:49,472 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_05-funloop_hard2.i that has 2 procedures, 180 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-15 00:25:49,472 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:25:49,540 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:25:49,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:25:49,589 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;@5f99611c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:25:49,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-15 00:25:49,644 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:25:49,644 INFO L124 PetriNetUnfolderBase]: 1/114 cut-off events. [2025-03-15 00:25:49,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:25:49,646 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:49,647 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] [2025-03-15 00:25:49,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:49,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1948885187, now seen corresponding path program 1 times [2025-03-15 00:25:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:49,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821189844] [2025-03-15 00:25:49,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:49,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:49,961 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:25:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821189844] [2025-03-15 00:25:49,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821189844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:49,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:49,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:25:49,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101918526] [2025-03-15 00:25:49,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:49,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:49,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:49,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:49,990 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-03-15 00:25:49,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 182 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:25:49,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:49,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-03-15 00:25:49,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:50,115 INFO L124 PetriNetUnfolderBase]: 17/319 cut-off events. [2025-03-15 00:25:50,115 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:25:50,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 319 events. 17/319 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 880 event pairs, 10 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 266. Up to 41 conditions per place. [2025-03-15 00:25:50,125 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 18 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2025-03-15 00:25:50,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 185 transitions, 413 flow [2025-03-15 00:25:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-03-15 00:25:50,136 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9505494505494505 [2025-03-15 00:25:50,139 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 1 predicate places. [2025-03-15 00:25:50,139 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 185 transitions, 413 flow [2025-03-15 00:25:50,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:25:50,139 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:50,139 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] [2025-03-15 00:25:50,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:25:50,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:50,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash 740691328, now seen corresponding path program 1 times [2025-03-15 00:25:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:50,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284173383] [2025-03-15 00:25:50,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:50,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:50,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:50,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284173383] [2025-03-15 00:25:50,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284173383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:25:50,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395166991] [2025-03-15 00:25:50,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:50,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:50,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:50,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:25:50,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 00:25:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:50,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-15 00:25:50,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:25:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 00:25:50,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:25:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395166991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:50,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:25:50,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-15 00:25:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559594189] [2025-03-15 00:25:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:50,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:50,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:50,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:50,418 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-03-15 00:25:50,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 185 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:25:50,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:50,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-03-15 00:25:50,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:50,550 INFO L124 PetriNetUnfolderBase]: 37/432 cut-off events. [2025-03-15 00:25:50,550 INFO L125 PetriNetUnfolderBase]: For 43/48 co-relation queries the response was YES. [2025-03-15 00:25:50,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 432 events. 37/432 cut-off events. For 43/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1590 event pairs, 20 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 488. Up to 65 conditions per place. [2025-03-15 00:25:50,556 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 22 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-03-15 00:25:50,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 193 transitions, 485 flow [2025-03-15 00:25:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2025-03-15 00:25:50,558 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9578754578754579 [2025-03-15 00:25:50,559 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 3 predicate places. [2025-03-15 00:25:50,559 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 193 transitions, 485 flow [2025-03-15 00:25:50,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:25:50,559 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:50,559 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] [2025-03-15 00:25:50,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 00:25:50,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:50,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:50,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1488243323, now seen corresponding path program 1 times [2025-03-15 00:25:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:50,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408442603] [2025-03-15 00:25:50,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:50,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:50,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408442603] [2025-03-15 00:25:50,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408442603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:25:50,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299362931] [2025-03-15 00:25:50,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:50,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:50,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:50,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:25:50,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 00:25:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:50,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:25:50,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:25:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:51,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:25:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:51,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299362931] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:25:51,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:25:51,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:25:51,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446949921] [2025-03-15 00:25:51,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:25:51,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:25:51,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:51,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:25:51,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:25:51,057 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 182 [2025-03-15 00:25:51,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 193 transitions, 485 flow. Second operand has 10 states, 10 states have (on average 167.3) internal successors, (1673), 10 states have internal predecessors, (1673), 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:25:51,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:51,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 182 [2025-03-15 00:25:51,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:51,214 INFO L124 PetriNetUnfolderBase]: 53/468 cut-off events. [2025-03-15 00:25:51,214 INFO L125 PetriNetUnfolderBase]: For 159/177 co-relation queries the response was YES. [2025-03-15 00:25:51,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 468 events. 53/468 cut-off events. For 159/177 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1696 event pairs, 15 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 620. Up to 86 conditions per place. [2025-03-15 00:25:51,218 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 23 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2025-03-15 00:25:51,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 200 transitions, 573 flow [2025-03-15 00:25:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:25:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:25:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1515 transitions. [2025-03-15 00:25:51,221 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.924908424908425 [2025-03-15 00:25:51,221 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 11 predicate places. [2025-03-15 00:25:51,221 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 200 transitions, 573 flow [2025-03-15 00:25:51,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 167.3) internal successors, (1673), 10 states have internal predecessors, (1673), 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:25:51,224 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:51,225 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:51,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 00:25:51,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-15 00:25:51,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:51,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:51,427 INFO L85 PathProgramCache]: Analyzing trace with hash 492574875, now seen corresponding path program 2 times [2025-03-15 00:25:51,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:51,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618823236] [2025-03-15 00:25:51,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:51,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:51,456 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:51,456 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-15 00:25:51,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618823236] [2025-03-15 00:25:51,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618823236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:51,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:51,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:51,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14743449] [2025-03-15 00:25:51,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:51,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:51,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:51,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:51,828 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 182 [2025-03-15 00:25:51,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 200 transitions, 573 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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:25:51,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:51,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 182 [2025-03-15 00:25:51,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:52,667 INFO L124 PetriNetUnfolderBase]: 1082/3282 cut-off events. [2025-03-15 00:25:52,667 INFO L125 PetriNetUnfolderBase]: For 1568/1596 co-relation queries the response was YES. [2025-03-15 00:25:52,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6440 conditions, 3282 events. 1082/3282 cut-off events. For 1568/1596 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 23341 event pairs, 504 based on Foata normal form. 8/2999 useless extension candidates. Maximal degree in co-relation 6298. Up to 1654 conditions per place. [2025-03-15 00:25:52,685 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 140 selfloop transitions, 38 changer transitions 0/326 dead transitions. [2025-03-15 00:25:52,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 326 transitions, 1325 flow [2025-03-15 00:25:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 971 transitions. [2025-03-15 00:25:52,689 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8891941391941391 [2025-03-15 00:25:52,689 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 16 predicate places. [2025-03-15 00:25:52,689 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 326 transitions, 1325 flow [2025-03-15 00:25:52,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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:25:52,690 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:52,690 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:52,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:25:52,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:52,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash 852912326, now seen corresponding path program 1 times [2025-03-15 00:25:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449124550] [2025-03-15 00:25:52,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:52,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:52,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449124550] [2025-03-15 00:25:52,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449124550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:25:52,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079934558] [2025-03-15 00:25:52,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:52,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:52,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:52,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:25:52,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 00:25:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:52,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:25:52,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:25:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:52,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:25:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:53,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079934558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:25:53,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:25:53,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:25:53,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738139463] [2025-03-15 00:25:53,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:25:53,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:25:53,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:53,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:25:53,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:25:53,059 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 182 [2025-03-15 00:25:53,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 326 transitions, 1325 flow. Second operand has 18 states, 18 states have (on average 167.38888888888889) internal successors, (3013), 18 states have internal predecessors, (3013), 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:25:53,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:53,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 182 [2025-03-15 00:25:53,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:53,587 INFO L124 PetriNetUnfolderBase]: 1084/3476 cut-off events. [2025-03-15 00:25:53,588 INFO L125 PetriNetUnfolderBase]: For 2653/2679 co-relation queries the response was YES. [2025-03-15 00:25:53,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7004 conditions, 3476 events. 1084/3476 cut-off events. For 2653/2679 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 25176 event pairs, 520 based on Foata normal form. 0/3162 useless extension candidates. Maximal degree in co-relation 6764. Up to 1667 conditions per place. [2025-03-15 00:25:53,603 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 55 selfloop transitions, 21 changer transitions 0/346 dead transitions. [2025-03-15 00:25:53,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 346 transitions, 1589 flow [2025-03-15 00:25:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:25:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:25:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3517 transitions. [2025-03-15 00:25:53,627 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9201988487702774 [2025-03-15 00:25:53,628 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 36 predicate places. [2025-03-15 00:25:53,628 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 346 transitions, 1589 flow [2025-03-15 00:25:53,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 167.38888888888889) internal successors, (3013), 18 states have internal predecessors, (3013), 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:25:53,629 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:53,629 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:53,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 00:25:53,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:53,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:53,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash -153252602, now seen corresponding path program 2 times [2025-03-15 00:25:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:53,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803979300] [2025-03-15 00:25:53,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:53,847 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:53,847 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-15 00:25:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803979300] [2025-03-15 00:25:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803979300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:54,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:54,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:54,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191027886] [2025-03-15 00:25:54,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:54,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:54,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:54,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:54,095 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 182 [2025-03-15 00:25:54,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 346 transitions, 1589 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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:25:54,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:54,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 182 [2025-03-15 00:25:54,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:54,771 INFO L124 PetriNetUnfolderBase]: 1451/4356 cut-off events. [2025-03-15 00:25:54,771 INFO L125 PetriNetUnfolderBase]: For 4253/4400 co-relation queries the response was YES. [2025-03-15 00:25:54,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11197 conditions, 4356 events. 1451/4356 cut-off events. For 4253/4400 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 31929 event pairs, 543 based on Foata normal form. 0/4006 useless extension candidates. Maximal degree in co-relation 10955. Up to 2123 conditions per place. [2025-03-15 00:25:54,790 INFO L140 encePairwiseOnDemand]: 171/182 looper letters, 237 selfloop transitions, 50 changer transitions 0/456 dead transitions. [2025-03-15 00:25:54,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 456 transitions, 2729 flow [2025-03-15 00:25:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2025-03-15 00:25:54,793 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8379120879120879 [2025-03-15 00:25:54,794 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 41 predicate places. [2025-03-15 00:25:54,794 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 456 transitions, 2729 flow [2025-03-15 00:25:54,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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:25:54,796 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:54,796 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:54,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:25:54,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:54,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:54,797 INFO L85 PathProgramCache]: Analyzing trace with hash 905681760, now seen corresponding path program 1 times [2025-03-15 00:25:54,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:54,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330346824] [2025-03-15 00:25:54,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:54,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:55,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:55,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330346824] [2025-03-15 00:25:55,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330346824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:25:55,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612546694] [2025-03-15 00:25:55,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:55,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:55,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:55,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:25:55,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 00:25:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:55,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:25:55,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:25:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:55,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:25:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:55,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612546694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:25:55,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:25:55,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 00:25:55,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680182499] [2025-03-15 00:25:55,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:25:55,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 00:25:55,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:55,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 00:25:55,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 00:25:55,482 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 182 [2025-03-15 00:25:55,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 456 transitions, 2729 flow. Second operand has 23 states, 23 states have (on average 167.52173913043478) internal successors, (3853), 23 states have internal predecessors, (3853), 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:25:55,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:55,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 182 [2025-03-15 00:25:55,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:56,177 INFO L124 PetriNetUnfolderBase]: 1452/4178 cut-off events. [2025-03-15 00:25:56,177 INFO L125 PetriNetUnfolderBase]: For 6225/6370 co-relation queries the response was YES. [2025-03-15 00:25:56,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11443 conditions, 4178 events. 1452/4178 cut-off events. For 6225/6370 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 29707 event pairs, 529 based on Foata normal form. 0/3846 useless extension candidates. Maximal degree in co-relation 11087. Up to 2118 conditions per place. [2025-03-15 00:25:56,200 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 77 selfloop transitions, 30 changer transitions 0/471 dead transitions. [2025-03-15 00:25:56,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 471 transitions, 3057 flow [2025-03-15 00:25:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 00:25:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 00:25:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5016 transitions. [2025-03-15 00:25:56,207 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9186813186813186 [2025-03-15 00:25:56,208 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 70 predicate places. [2025-03-15 00:25:56,209 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 471 transitions, 3057 flow [2025-03-15 00:25:56,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 167.52173913043478) internal successors, (3853), 23 states have internal predecessors, (3853), 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:25:56,210 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:56,210 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:56,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 00:25:56,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:56,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:56,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:56,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1995072317, now seen corresponding path program 2 times [2025-03-15 00:25:56,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:56,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907412569] [2025-03-15 00:25:56,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:56,431 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:56,431 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:25:56,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:56,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907412569] [2025-03-15 00:25:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907412569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:56,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:56,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715759361] [2025-03-15 00:25:56,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:56,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:56,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:56,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:56,656 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 182 [2025-03-15 00:25:56,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 471 transitions, 3057 flow. Second operand has 6 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 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:25:56,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:56,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 182 [2025-03-15 00:25:56,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:57,549 INFO L124 PetriNetUnfolderBase]: 1839/5226 cut-off events. [2025-03-15 00:25:57,550 INFO L125 PetriNetUnfolderBase]: For 9047/9681 co-relation queries the response was YES. [2025-03-15 00:25:57,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17299 conditions, 5226 events. 1839/5226 cut-off events. For 9047/9681 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 39225 event pairs, 437 based on Foata normal form. 0/4821 useless extension candidates. Maximal degree in co-relation 16941. Up to 2961 conditions per place. [2025-03-15 00:25:57,577 INFO L140 encePairwiseOnDemand]: 159/182 looper letters, 317 selfloop transitions, 93 changer transitions 16/608 dead transitions. [2025-03-15 00:25:57,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 608 transitions, 4967 flow [2025-03-15 00:25:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 960 transitions. [2025-03-15 00:25:57,579 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8791208791208791 [2025-03-15 00:25:57,581 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 75 predicate places. [2025-03-15 00:25:57,581 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 608 transitions, 4967 flow [2025-03-15 00:25:57,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 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:25:57,581 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:57,581 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:57,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:25:57,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1782521812, now seen corresponding path program 1 times [2025-03-15 00:25:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:57,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633279721] [2025-03-15 00:25:57,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:25:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633279721] [2025-03-15 00:25:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633279721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:57,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:57,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110743011] [2025-03-15 00:25:57,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:57,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:57,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:57,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:57,945 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 182 [2025-03-15 00:25:57,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 608 transitions, 4967 flow. Second operand has 6 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 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:25:57,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:57,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 182 [2025-03-15 00:25:57,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:58,738 INFO L124 PetriNetUnfolderBase]: 2183/6129 cut-off events. [2025-03-15 00:25:58,738 INFO L125 PetriNetUnfolderBase]: For 12062/12823 co-relation queries the response was YES. [2025-03-15 00:25:58,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23721 conditions, 6129 events. 2183/6129 cut-off events. For 12062/12823 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 46856 event pairs, 455 based on Foata normal form. 0/5695 useless extension candidates. Maximal degree in co-relation 23361. Up to 3453 conditions per place. [2025-03-15 00:25:58,765 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 419 selfloop transitions, 79 changer transitions 16/697 dead transitions. [2025-03-15 00:25:58,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 697 transitions, 6861 flow [2025-03-15 00:25:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 904 transitions. [2025-03-15 00:25:58,767 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8278388278388278 [2025-03-15 00:25:58,767 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 80 predicate places. [2025-03-15 00:25:58,767 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 697 transitions, 6861 flow [2025-03-15 00:25:58,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 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:25:58,768 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:58,768 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:58,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:25:58,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:25:58,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1196912030, now seen corresponding path program 1 times [2025-03-15 00:25:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425770293] [2025-03-15 00:25:58,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:25:59,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:59,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425770293] [2025-03-15 00:25:59,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425770293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:59,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:59,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:25:59,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773379388] [2025-03-15 00:25:59,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:59,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:25:59,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:59,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:25:59,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:25:59,122 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:25:59,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 697 transitions, 6861 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:25:59,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:59,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:25:59,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:00,847 INFO L124 PetriNetUnfolderBase]: 4242/10177 cut-off events. [2025-03-15 00:26:00,847 INFO L125 PetriNetUnfolderBase]: For 26601/26864 co-relation queries the response was YES. [2025-03-15 00:26:00,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46344 conditions, 10177 events. 4242/10177 cut-off events. For 26601/26864 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 77859 event pairs, 959 based on Foata normal form. 18/9561 useless extension candidates. Maximal degree in co-relation 45909. Up to 5391 conditions per place. [2025-03-15 00:26:00,901 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 1343 selfloop transitions, 43 changer transitions 0/1471 dead transitions. [2025-03-15 00:26:00,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1471 transitions, 17379 flow [2025-03-15 00:26:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 774 transitions. [2025-03-15 00:26:00,903 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2025-03-15 00:26:00,904 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 88 predicate places. [2025-03-15 00:26:00,904 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 1471 transitions, 17379 flow [2025-03-15 00:26:00,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:00,904 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:00,904 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:00,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:26:00,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:26:00,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash -857226794, now seen corresponding path program 1 times [2025-03-15 00:26:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:00,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901226691] [2025-03-15 00:26:00,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:26:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:26:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901226691] [2025-03-15 00:26:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901226691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206618739] [2025-03-15 00:26:01,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:01,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:01,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:01,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:01,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:01,219 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:26:01,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 1471 transitions, 17379 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:01,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:01,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:26:01,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:05,619 INFO L124 PetriNetUnfolderBase]: 8107/19160 cut-off events. [2025-03-15 00:26:05,619 INFO L125 PetriNetUnfolderBase]: For 61868/62865 co-relation queries the response was YES. [2025-03-15 00:26:05,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104508 conditions, 19160 events. 8107/19160 cut-off events. For 61868/62865 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 161526 event pairs, 1130 based on Foata normal form. 33/18007 useless extension candidates. Maximal degree in co-relation 103998. Up to 10602 conditions per place. [2025-03-15 00:26:05,725 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 2719 selfloop transitions, 106 changer transitions 54/2964 dead transitions. [2025-03-15 00:26:05,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 2964 transitions, 41835 flow [2025-03-15 00:26:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 814 transitions. [2025-03-15 00:26:05,728 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49694749694749696 [2025-03-15 00:26:05,729 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 96 predicate places. [2025-03-15 00:26:05,729 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 2964 transitions, 41835 flow [2025-03-15 00:26:05,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:05,729 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:05,729 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:05,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:26:05,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:26:05,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1314518674, now seen corresponding path program 2 times [2025-03-15 00:26:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:05,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835029834] [2025-03-15 00:26:05,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:26:05,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:05,752 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:26:05,752 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835029834] [2025-03-15 00:26:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835029834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:05,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:05,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469721068] [2025-03-15 00:26:05,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:05,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:05,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:05,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:05,965 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:26:05,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 2964 transitions, 41835 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:05,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:05,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:26:05,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:13,390 INFO L124 PetriNetUnfolderBase]: 8185/19368 cut-off events. [2025-03-15 00:26:13,390 INFO L125 PetriNetUnfolderBase]: For 75462/76873 co-relation queries the response was YES. [2025-03-15 00:26:13,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121128 conditions, 19368 events. 8185/19368 cut-off events. For 75462/76873 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 163620 event pairs, 1099 based on Foata normal form. 79/18262 useless extension candidates. Maximal degree in co-relation 120543. Up to 10667 conditions per place. [2025-03-15 00:26:13,497 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 2937 selfloop transitions, 71 changer transitions 54/3147 dead transitions. [2025-03-15 00:26:13,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 3147 transitions, 50399 flow [2025-03-15 00:26:13,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 789 transitions. [2025-03-15 00:26:13,499 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4816849816849817 [2025-03-15 00:26:13,499 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 104 predicate places. [2025-03-15 00:26:13,499 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 3147 transitions, 50399 flow [2025-03-15 00:26:13,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:13,499 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:13,499 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:13,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:26:13,500 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:26:13,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash -898116232, now seen corresponding path program 1 times [2025-03-15 00:26:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393935304] [2025-03-15 00:26:13,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:26:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:26:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:13,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:13,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393935304] [2025-03-15 00:26:13,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393935304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:13,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:13,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467954503] [2025-03-15 00:26:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:13,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:13,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:13,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:13,808 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:26:13,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 3147 transitions, 50399 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:13,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:13,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:26:13,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:23,546 INFO L124 PetriNetUnfolderBase]: 10598/25059 cut-off events. [2025-03-15 00:26:23,546 INFO L125 PetriNetUnfolderBase]: For 116596/118632 co-relation queries the response was YES. [2025-03-15 00:26:23,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177141 conditions, 25059 events. 10598/25059 cut-off events. For 116596/118632 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 222605 event pairs, 1251 based on Foata normal form. 91/23681 useless extension candidates. Maximal degree in co-relation 176481. Up to 13959 conditions per place. [2025-03-15 00:26:23,741 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 4387 selfloop transitions, 77 changer transitions 54/4603 dead transitions. [2025-03-15 00:26:23,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 4603 transitions, 83477 flow [2025-03-15 00:26:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 843 transitions. [2025-03-15 00:26:23,743 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5146520146520146 [2025-03-15 00:26:23,743 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 112 predicate places. [2025-03-15 00:26:23,744 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 4603 transitions, 83477 flow [2025-03-15 00:26:23,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:23,744 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:23,744 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:23,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:26:23,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:26:23,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash 86511920, now seen corresponding path program 2 times [2025-03-15 00:26:23,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:23,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615889316] [2025-03-15 00:26:23,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:26:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:23,763 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:26:23,763 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615889316] [2025-03-15 00:26:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615889316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:24,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:24,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:24,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342417289] [2025-03-15 00:26:24,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:24,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:24,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:24,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:24,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:24,125 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:26:24,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 4603 transitions, 83477 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:24,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:24,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:26:24,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:39,324 INFO L124 PetriNetUnfolderBase]: 10628/25165 cut-off events. [2025-03-15 00:26:39,324 INFO L125 PetriNetUnfolderBase]: For 140880/143533 co-relation queries the response was YES. [2025-03-15 00:26:39,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198032 conditions, 25165 events. 10628/25165 cut-off events. For 140880/143533 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 223838 event pairs, 1251 based on Foata normal form. 160/23856 useless extension candidates. Maximal degree in co-relation 197297. Up to 14018 conditions per place. [2025-03-15 00:26:39,517 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 4442 selfloop transitions, 54 changer transitions 54/4635 dead transitions. [2025-03-15 00:26:39,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 4635 transitions, 93161 flow [2025-03-15 00:26:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2025-03-15 00:26:39,519 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5134310134310134 [2025-03-15 00:26:39,519 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 120 predicate places. [2025-03-15 00:26:39,519 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 4635 transitions, 93161 flow [2025-03-15 00:26:39,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:39,519 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:39,519 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:39,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:26:39,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:26:39,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1038439036, now seen corresponding path program 3 times [2025-03-15 00:26:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:39,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305703857] [2025-03-15 00:26:39,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:26:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:39,536 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:26:39,536 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:39,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:39,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305703857] [2025-03-15 00:26:39,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305703857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:39,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:39,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:39,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603064437] [2025-03-15 00:26:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:39,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:39,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:39,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:39,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:39,823 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:26:39,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 4635 transitions, 93161 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:39,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:39,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:26:39,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:55,268 INFO L124 PetriNetUnfolderBase]: 10628/25184 cut-off events. [2025-03-15 00:26:55,268 INFO L125 PetriNetUnfolderBase]: For 167100/170250 co-relation queries the response was YES. [2025-03-15 00:26:55,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218311 conditions, 25184 events. 10628/25184 cut-off events. For 167100/170250 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 224172 event pairs, 1251 based on Foata normal form. 151/23866 useless extension candidates. Maximal degree in co-relation 217501. Up to 14029 conditions per place. [2025-03-15 00:26:55,468 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 4395 selfloop transitions, 114 changer transitions 54/4648 dead transitions. [2025-03-15 00:26:55,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 4648 transitions, 102549 flow [2025-03-15 00:26:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 826 transitions. [2025-03-15 00:26:55,470 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2025-03-15 00:26:55,470 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 128 predicate places. [2025-03-15 00:26:55,470 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 4648 transitions, 102549 flow [2025-03-15 00:26:55,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:26:55,471 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:55,471 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:55,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:26:55,471 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:26:55,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash -608599552, now seen corresponding path program 4 times [2025-03-15 00:26:55,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:55,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060821089] [2025-03-15 00:26:55,472 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:26:55,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:55,496 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:26:55,497 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:56,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:56,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060821089] [2025-03-15 00:26:56,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060821089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:56,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:56,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:26:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554381889] [2025-03-15 00:26:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:56,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:26:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:56,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:26:56,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:26:56,016 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:26:56,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 4648 transitions, 102549 flow. Second operand has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:26:56,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:56,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:26:56,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:10,305 INFO L124 PetriNetUnfolderBase]: 9992/23717 cut-off events. [2025-03-15 00:27:10,306 INFO L125 PetriNetUnfolderBase]: For 185289/188895 co-relation queries the response was YES. [2025-03-15 00:27:10,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224627 conditions, 23717 events. 9992/23717 cut-off events. For 185289/188895 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 208237 event pairs, 1179 based on Foata normal form. 177/22515 useless extension candidates. Maximal degree in co-relation 223742. Up to 13131 conditions per place. [2025-03-15 00:27:10,503 INFO L140 encePairwiseOnDemand]: 165/182 looper letters, 4075 selfloop transitions, 59 changer transitions 54/4273 dead transitions. [2025-03-15 00:27:10,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 4273 transitions, 102345 flow [2025-03-15 00:27:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:27:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:27:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 871 transitions. [2025-03-15 00:27:10,504 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2025-03-15 00:27:10,504 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 137 predicate places. [2025-03-15 00:27:10,504 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 4273 transitions, 102345 flow [2025-03-15 00:27:10,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:27:10,505 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:10,505 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:10,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:27:10,505 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:27:10,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1201133358, now seen corresponding path program 5 times [2025-03-15 00:27:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:10,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143160739] [2025-03-15 00:27:10,506 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:27:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:10,528 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:27:10,528 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:27:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143160739] [2025-03-15 00:27:11,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143160739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:27:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934536619] [2025-03-15 00:27:11,260 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:27:11,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:27:11,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:27:11,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:27:11,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 00:27:11,384 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:27:11,384 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:11,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-15 00:27:11,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:27:11,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 00:27:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:27:11,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:27:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934536619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:11,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:27:11,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-15 00:27:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312116503] [2025-03-15 00:27:11,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:11,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:27:11,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:11,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:27:11,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-15 00:27:11,673 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:27:11,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 4273 transitions, 102345 flow. Second operand has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:27:11,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:11,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:27:11,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:26,792 INFO L124 PetriNetUnfolderBase]: 10018/23794 cut-off events. [2025-03-15 00:27:26,793 INFO L125 PetriNetUnfolderBase]: For 216310/220423 co-relation queries the response was YES. [2025-03-15 00:27:26,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244473 conditions, 23794 events. 10018/23794 cut-off events. For 216310/220423 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 208995 event pairs, 1179 based on Foata normal form. 149/22565 useless extension candidates. Maximal degree in co-relation 243513. Up to 13190 conditions per place. [2025-03-15 00:27:27,016 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 4036 selfloop transitions, 126 changer transitions 54/4301 dead transitions. [2025-03-15 00:27:27,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 4301 transitions, 111445 flow [2025-03-15 00:27:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:27:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:27:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 856 transitions. [2025-03-15 00:27:27,017 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4703296703296703 [2025-03-15 00:27:27,018 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 146 predicate places. [2025-03-15 00:27:27,018 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 4301 transitions, 111445 flow [2025-03-15 00:27:27,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:27:27,018 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:27,018 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:27,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 00:27:27,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-15 00:27:27,221 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:27:27,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1200815890, now seen corresponding path program 6 times [2025-03-15 00:27:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713032659] [2025-03-15 00:27:27,222 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:27:27,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:27,241 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:27:27,241 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:27:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:27,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713032659] [2025-03-15 00:27:27,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713032659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:27,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:27,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:27:27,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335597660] [2025-03-15 00:27:27,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:27,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:27:27,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:27,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:27:27,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:27:27,554 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:27:27,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 4301 transitions, 111445 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:27:27,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:27,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:27:27,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:42,699 INFO L124 PetriNetUnfolderBase]: 10018/23811 cut-off events. [2025-03-15 00:27:42,699 INFO L125 PetriNetUnfolderBase]: For 249045/253482 co-relation queries the response was YES. [2025-03-15 00:27:42,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263762 conditions, 23811 events. 10018/23811 cut-off events. For 249045/253482 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 209331 event pairs, 1211 based on Foata normal form. 161/22595 useless extension candidates. Maximal degree in co-relation 262727. Up to 13201 conditions per place. [2025-03-15 00:27:42,937 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 4088 selfloop transitions, 87 changer transitions 54/4314 dead transitions. [2025-03-15 00:27:42,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 4314 transitions, 120243 flow [2025-03-15 00:27:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:27:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:27:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 827 transitions. [2025-03-15 00:27:42,938 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5048840048840049 [2025-03-15 00:27:42,938 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 154 predicate places. [2025-03-15 00:27:42,938 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 4314 transitions, 120243 flow [2025-03-15 00:27:42,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:27:42,939 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:42,939 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:42,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:27:42,939 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:27:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash 70491828, now seen corresponding path program 7 times [2025-03-15 00:27:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240117993] [2025-03-15 00:27:42,940 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:27:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:27:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:27:43,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240117993] [2025-03-15 00:27:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240117993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:43,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:43,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:27:43,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389414250] [2025-03-15 00:27:43,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:43,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:27:43,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:43,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:27:43,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:27:43,128 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:27:43,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 4314 transitions, 120243 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:27:43,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:43,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:27:43,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:57,982 INFO L124 PetriNetUnfolderBase]: 9357/22290 cut-off events. [2025-03-15 00:27:57,982 INFO L125 PetriNetUnfolderBase]: For 266342/271201 co-relation queries the response was YES. [2025-03-15 00:27:58,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265039 conditions, 22290 events. 9357/22290 cut-off events. For 266342/271201 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 193353 event pairs, 1160 based on Foata normal form. 168/21173 useless extension candidates. Maximal degree in co-relation 263929. Up to 12285 conditions per place. [2025-03-15 00:27:58,208 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 3712 selfloop transitions, 63 changer transitions 54/3914 dead transitions. [2025-03-15 00:27:58,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 3914 transitions, 116373 flow [2025-03-15 00:27:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:27:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:27:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 806 transitions. [2025-03-15 00:27:58,209 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2025-03-15 00:27:58,210 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 162 predicate places. [2025-03-15 00:27:58,210 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 3914 transitions, 116373 flow [2025-03-15 00:27:58,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:27:58,210 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:58,210 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:58,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:27:58,210 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:27:58,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash -382730492, now seen corresponding path program 8 times [2025-03-15 00:27:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:58,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683234360] [2025-03-15 00:27:58,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:27:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:58,227 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:27:58,227 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:27:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683234360] [2025-03-15 00:27:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683234360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:27:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100312395] [2025-03-15 00:27:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:58,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:27:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:58,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:27:58,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:27:58,383 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:27:58,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 3914 transitions, 116373 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:27:58,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:58,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:27:58,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:28:13,852 INFO L124 PetriNetUnfolderBase]: 10068/23990 cut-off events. [2025-03-15 00:28:13,853 INFO L125 PetriNetUnfolderBase]: For 328660/334060 co-relation queries the response was YES. [2025-03-15 00:28:13,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304178 conditions, 23990 events. 10068/23990 cut-off events. For 328660/334060 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 211376 event pairs, 1211 based on Foata normal form. 126/22741 useless extension candidates. Maximal degree in co-relation 302993. Up to 13284 conditions per place. [2025-03-15 00:28:14,104 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 4130 selfloop transitions, 86 changer transitions 54/4355 dead transitions. [2025-03-15 00:28:14,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 4355 transitions, 138459 flow [2025-03-15 00:28:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:28:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:28:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 823 transitions. [2025-03-15 00:28:14,105 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5024420024420024 [2025-03-15 00:28:14,105 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 170 predicate places. [2025-03-15 00:28:14,105 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 4355 transitions, 138459 flow [2025-03-15 00:28:14,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:28:14,106 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:28:14,106 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:14,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:28:14,106 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:28:14,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:28:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1576947136, now seen corresponding path program 9 times [2025-03-15 00:28:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:28:14,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549911164] [2025-03-15 00:28:14,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:28:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:28:14,120 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:28:14,121 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:28:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:28:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:28:14,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549911164] [2025-03-15 00:28:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549911164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:28:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:28:14,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:28:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318044261] [2025-03-15 00:28:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:28:14,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:28:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:28:14,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:28:14,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:28:14,246 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:28:14,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 4355 transitions, 138459 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:28:14,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:28:14,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:28:14,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:28:30,975 INFO L124 PetriNetUnfolderBase]: 10096/24059 cut-off events. [2025-03-15 00:28:30,975 INFO L125 PetriNetUnfolderBase]: For 372235/378208 co-relation queries the response was YES. [2025-03-15 00:28:31,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324784 conditions, 24059 events. 10096/24059 cut-off events. For 372235/378208 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 212251 event pairs, 1251 based on Foata normal form. 161/22841 useless extension candidates. Maximal degree in co-relation 323524. Up to 13339 conditions per place. [2025-03-15 00:28:31,208 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 4185 selfloop transitions, 63 changer transitions 54/4387 dead transitions. [2025-03-15 00:28:31,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 4387 transitions, 148095 flow [2025-03-15 00:28:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:28:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:28:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 821 transitions. [2025-03-15 00:28:31,210 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5012210012210012 [2025-03-15 00:28:31,210 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 178 predicate places. [2025-03-15 00:28:31,210 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 4387 transitions, 148095 flow [2025-03-15 00:28:31,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:28:31,211 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:28:31,211 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:31,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 00:28:31,211 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:28:31,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:28:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1451519620, now seen corresponding path program 10 times [2025-03-15 00:28:31,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:28:31,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273423327] [2025-03-15 00:28:31,212 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:28:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:28:31,228 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:28:31,228 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:28:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:28:31,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:28:31,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273423327] [2025-03-15 00:28:31,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273423327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:28:31,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:28:31,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 00:28:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120935991] [2025-03-15 00:28:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:28:31,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:28:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:28:31,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:28:31,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-15 00:28:31,648 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:28:31,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 4387 transitions, 148095 flow. Second operand has 15 states, 15 states have (on average 53.13333333333333) internal successors, (797), 15 states have internal predecessors, (797), 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:28:31,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:28:31,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:28:31,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:28:52,698 INFO L124 PetriNetUnfolderBase]: 10781/25741 cut-off events. [2025-03-15 00:28:52,698 INFO L125 PetriNetUnfolderBase]: For 451964/458268 co-relation queries the response was YES. [2025-03-15 00:28:52,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366815 conditions, 25741 events. 10781/25741 cut-off events. For 451964/458268 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 230952 event pairs, 1258 based on Foata normal form. 112/24396 useless extension candidates. Maximal degree in co-relation 365480. Up to 14332 conditions per place. [2025-03-15 00:28:52,982 INFO L140 encePairwiseOnDemand]: 155/182 looper letters, 4365 selfloop transitions, 546 changer transitions 54/5050 dead transitions. [2025-03-15 00:28:52,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 5050 transitions, 180417 flow [2025-03-15 00:28:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 00:28:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 00:28:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1777 transitions. [2025-03-15 00:28:52,984 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.39054945054945056 [2025-03-15 00:28:52,984 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 202 predicate places. [2025-03-15 00:28:52,984 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 5050 transitions, 180417 flow [2025-03-15 00:28:52,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 53.13333333333333) internal successors, (797), 15 states have internal predecessors, (797), 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:28:52,984 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:28:52,985 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:52,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:28:52,985 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:28:52,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:28:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash -75260178, now seen corresponding path program 3 times [2025-03-15 00:28:52,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:28:52,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625356463] [2025-03-15 00:28:52,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:28:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:28:52,998 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:28:52,998 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:28:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:28:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:28:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625356463] [2025-03-15 00:28:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625356463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:28:53,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:28:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:28:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518707411] [2025-03-15 00:28:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:28:53,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:28:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:28:53,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:28:53,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:28:53,135 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:28:53,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 5050 transitions, 180417 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:28:53,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:28:53,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:28:53,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:14,612 INFO L124 PetriNetUnfolderBase]: 10098/24157 cut-off events. [2025-03-15 00:29:14,612 INFO L125 PetriNetUnfolderBase]: For 472921/479550 co-relation queries the response was YES. [2025-03-15 00:29:14,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363876 conditions, 24157 events. 10098/24157 cut-off events. For 472921/479550 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 213502 event pairs, 1176 based on Foata normal form. 137/22922 useless extension candidates. Maximal degree in co-relation 362466. Up to 13375 conditions per place. [2025-03-15 00:29:15,090 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 4318 selfloop transitions, 147 changer transitions 54/4604 dead transitions. [2025-03-15 00:29:15,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 4604 transitions, 173189 flow [2025-03-15 00:29:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:29:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:29:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 806 transitions. [2025-03-15 00:29:15,092 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2025-03-15 00:29:15,092 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 200 predicate places. [2025-03-15 00:29:15,092 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 4604 transitions, 173189 flow [2025-03-15 00:29:15,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:29:15,093 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:15,093 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:15,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 00:29:15,093 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:29:15,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 157106394, now seen corresponding path program 11 times [2025-03-15 00:29:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:15,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983331265] [2025-03-15 00:29:15,094 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:29:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:15,118 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:29:15,118 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:29:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983331265] [2025-03-15 00:29:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983331265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:29:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767345580] [2025-03-15 00:29:15,405 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:29:15,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:29:15,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:29:15,407 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:29:15,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 00:29:15,534 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:29:15,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:15,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-15 00:29:15,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:29:15,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 00:29:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:29:15,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:29:15,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767345580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:15,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:29:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-15 00:29:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689648411] [2025-03-15 00:29:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:15,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:29:15,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:15,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:29:15,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:29:15,737 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:29:15,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 4604 transitions, 173189 flow. Second operand has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:29:15,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:15,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:29:15,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:37,971 INFO L124 PetriNetUnfolderBase]: 10101/24146 cut-off events. [2025-03-15 00:29:37,972 INFO L125 PetriNetUnfolderBase]: For 519016/526207 co-relation queries the response was YES. [2025-03-15 00:29:38,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383778 conditions, 24146 events. 10101/24146 cut-off events. For 519016/526207 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 213661 event pairs, 1192 based on Foata normal form. 155/22920 useless extension candidates. Maximal degree in co-relation 382293. Up to 13334 conditions per place. [2025-03-15 00:29:38,462 INFO L140 encePairwiseOnDemand]: 165/182 looper letters, 4310 selfloop transitions, 111 changer transitions 54/4560 dead transitions. [2025-03-15 00:29:38,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 4560 transitions, 180287 flow [2025-03-15 00:29:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:29:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:29:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1057 transitions. [2025-03-15 00:29:38,464 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4467455621301775 [2025-03-15 00:29:38,464 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 212 predicate places. [2025-03-15 00:29:38,464 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 4560 transitions, 180287 flow [2025-03-15 00:29:38,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:29:38,465 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:38,465 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:38,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-15 00:29:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:29:38,665 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:29:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1302480448, now seen corresponding path program 12 times [2025-03-15 00:29:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651582007] [2025-03-15 00:29:38,666 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:29:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:38,683 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:29:38,683 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:29:38,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:38,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651582007] [2025-03-15 00:29:38,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651582007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:38,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:38,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:29:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115325721] [2025-03-15 00:29:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:38,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:29:38,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:38,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:29:38,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:29:38,828 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:29:38,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 4560 transitions, 180287 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:29:38,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:38,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:29:38,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:57,997 INFO L124 PetriNetUnfolderBase]: 10101/24159 cut-off events. [2025-03-15 00:29:57,998 INFO L125 PetriNetUnfolderBase]: For 572478/580103 co-relation queries the response was YES. [2025-03-15 00:29:58,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403424 conditions, 24159 events. 10101/24159 cut-off events. For 572478/580103 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 213803 event pairs, 1198 based on Foata normal form. 130/22908 useless extension candidates. Maximal degree in co-relation 401864. Up to 13346 conditions per place. [2025-03-15 00:29:58,344 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 4312 selfloop transitions, 122 changer transitions 54/4573 dead transitions. [2025-03-15 00:29:58,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 4573 transitions, 189785 flow [2025-03-15 00:29:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:29:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:29:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 807 transitions. [2025-03-15 00:29:58,346 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4926739926739927 [2025-03-15 00:29:58,347 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 220 predicate places. [2025-03-15 00:29:58,347 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 4573 transitions, 189785 flow [2025-03-15 00:29:58,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:29:58,347 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:58,347 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:58,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 00:29:58,348 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:29:58,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1522817902, now seen corresponding path program 13 times [2025-03-15 00:29:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263988503] [2025-03-15 00:29:58,349 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:29:58,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:29:58,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263988503] [2025-03-15 00:29:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263988503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:58,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:29:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608756968] [2025-03-15 00:29:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:29:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:58,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:29:58,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:29:58,579 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:29:58,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 4573 transitions, 189785 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:29:58,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:58,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:29:58,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:19,683 INFO L124 PetriNetUnfolderBase]: 9390/22530 cut-off events. [2025-03-15 00:30:19,684 INFO L125 PetriNetUnfolderBase]: For 586163/593765 co-relation queries the response was YES. [2025-03-15 00:30:19,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394668 conditions, 22530 events. 9390/22530 cut-off events. For 586163/593765 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 197320 event pairs, 1130 based on Foata normal form. 136/21381 useless extension candidates. Maximal degree in co-relation 393033. Up to 12387 conditions per place. [2025-03-15 00:30:19,984 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 3894 selfloop transitions, 98 changer transitions 54/4131 dead transitions. [2025-03-15 00:30:19,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 4131 transitions, 178987 flow [2025-03-15 00:30:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:30:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:30:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 786 transitions. [2025-03-15 00:30:19,987 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.47985347985347987 [2025-03-15 00:30:19,988 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 227 predicate places. [2025-03-15 00:30:19,988 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 4131 transitions, 178987 flow [2025-03-15 00:30:19,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:30:19,988 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:19,988 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:19,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 00:30:19,989 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:30:19,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:19,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1178204178, now seen corresponding path program 14 times [2025-03-15 00:30:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310571055] [2025-03-15 00:30:19,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:30:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:20,018 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:30:20,018 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:30:20,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:20,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310571055] [2025-03-15 00:30:20,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310571055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:20,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:20,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:30:20,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251227170] [2025-03-15 00:30:20,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:20,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:30:20,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:20,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:30:20,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:30:20,256 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:30:20,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 4131 transitions, 178987 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:30:20,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:20,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:30:20,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:42,769 INFO L124 PetriNetUnfolderBase]: 10237/24530 cut-off events. [2025-03-15 00:30:42,769 INFO L125 PetriNetUnfolderBase]: For 702991/711454 co-relation queries the response was YES. [2025-03-15 00:30:42,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449126 conditions, 24530 events. 10237/24530 cut-off events. For 702991/711454 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 217825 event pairs, 1170 based on Foata normal form. 84/23233 useless extension candidates. Maximal degree in co-relation 447416. Up to 13563 conditions per place. [2025-03-15 00:30:43,296 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 4406 selfloop transitions, 107 changer transitions 54/4652 dead transitions. [2025-03-15 00:30:43,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 4652 transitions, 211317 flow [2025-03-15 00:30:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:30:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:30:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 821 transitions. [2025-03-15 00:30:43,298 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5012210012210012 [2025-03-15 00:30:43,298 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 235 predicate places. [2025-03-15 00:30:43,298 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 4652 transitions, 211317 flow [2025-03-15 00:30:43,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:30:43,298 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:43,298 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:43,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 00:30:43,298 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:30:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash -714813870, now seen corresponding path program 15 times [2025-03-15 00:30:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889069588] [2025-03-15 00:30:43,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:30:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:43,310 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:30:43,310 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:30:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:43,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889069588] [2025-03-15 00:30:43,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889069588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:43,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:43,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:30:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120461474] [2025-03-15 00:30:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:43,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:30:43,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:43,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:30:43,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:30:43,458 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:30:43,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 4652 transitions, 211317 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:30:43,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:43,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:30:43,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:12,709 INFO L124 PetriNetUnfolderBase]: 10950/26264 cut-off events. [2025-03-15 00:31:12,710 INFO L125 PetriNetUnfolderBase]: For 828831/837485 co-relation queries the response was YES. [2025-03-15 00:31:12,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500494 conditions, 26264 events. 10950/26264 cut-off events. For 828831/837485 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 236646 event pairs, 1204 based on Foata normal form. 92/24889 useless extension candidates. Maximal degree in co-relation 498709. Up to 14601 conditions per place. [2025-03-15 00:31:13,072 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 4859 selfloop transitions, 112 changer transitions 54/5110 dead transitions. [2025-03-15 00:31:13,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 5110 transitions, 242755 flow [2025-03-15 00:31:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:31:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:31:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 839 transitions. [2025-03-15 00:31:13,074 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5122100122100122 [2025-03-15 00:31:13,075 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 243 predicate places. [2025-03-15 00:31:13,076 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 5110 transitions, 242755 flow [2025-03-15 00:31:13,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:31:13,076 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:13,076 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:13,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 00:31:13,076 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:31:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash 269814282, now seen corresponding path program 16 times [2025-03-15 00:31:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:13,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119968279] [2025-03-15 00:31:13,077 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:31:13,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:13,094 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:31:13,094 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:31:13,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:13,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119968279] [2025-03-15 00:31:13,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119968279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:13,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:13,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 00:31:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129737404] [2025-03-15 00:31:13,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:13,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:31:13,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:13,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:31:13,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-15 00:31:13,628 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:31:13,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 5110 transitions, 242755 flow. Second operand has 15 states, 15 states have (on average 53.13333333333333) internal successors, (797), 15 states have internal predecessors, (797), 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:31:13,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:13,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:31:13,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:49,243 INFO L124 PetriNetUnfolderBase]: 11110/26640 cut-off events. [2025-03-15 00:31:49,243 INFO L125 PetriNetUnfolderBase]: For 914026/923215 co-relation queries the response was YES. [2025-03-15 00:31:49,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529184 conditions, 26640 events. 11110/26640 cut-off events. For 914026/923215 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 240652 event pairs, 1210 based on Foata normal form. 93/25258 useless extension candidates. Maximal degree in co-relation 527324. Up to 14838 conditions per place. [2025-03-15 00:31:49,793 INFO L140 encePairwiseOnDemand]: 155/182 looper letters, 4647 selfloop transitions, 493 changer transitions 54/5279 dead transitions. [2025-03-15 00:31:49,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 5279 transitions, 261183 flow [2025-03-15 00:31:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 00:31:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 00:31:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1538 transitions. [2025-03-15 00:31:49,795 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4225274725274725 [2025-03-15 00:31:49,795 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 262 predicate places. [2025-03-15 00:31:49,795 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 5279 transitions, 261183 flow [2025-03-15 00:31:49,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 53.13333333333333) internal successors, (797), 15 states have internal predecessors, (797), 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:31:49,796 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:49,796 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:49,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 00:31:49,796 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:31:49,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:49,797 INFO L85 PathProgramCache]: Analyzing trace with hash 923049566, now seen corresponding path program 4 times [2025-03-15 00:31:49,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:49,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408246707] [2025-03-15 00:31:49,797 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:31:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:49,814 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:31:49,814 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:31:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408246707] [2025-03-15 00:31:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408246707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:50,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-15 00:31:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407071522] [2025-03-15 00:31:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:50,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-15 00:31:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:50,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-15 00:31:50,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-15 00:31:50,371 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 182 [2025-03-15 00:31:50,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 5279 transitions, 261183 flow. Second operand has 16 states, 16 states have (on average 50.8125) internal successors, (813), 16 states have internal predecessors, (813), 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:31:50,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:50,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 182 [2025-03-15 00:31:50,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:26,149 INFO L124 PetriNetUnfolderBase]: 11596/27421 cut-off events. [2025-03-15 00:32:26,149 INFO L125 PetriNetUnfolderBase]: For 1015594/1023094 co-relation queries the response was YES. [2025-03-15 00:32:26,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563486 conditions, 27421 events. 11596/27421 cut-off events. For 1015594/1023094 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 246732 event pairs, 1326 based on Foata normal form. 203/26151 useless extension candidates. Maximal degree in co-relation 561551. Up to 15158 conditions per place. [2025-03-15 00:32:26,587 INFO L140 encePairwiseOnDemand]: 142/182 looper letters, 5096 selfloop transitions, 544 changer transitions 63/5785 dead transitions. [2025-03-15 00:32:26,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 5785 transitions, 296423 flow [2025-03-15 00:32:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-15 00:32:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-15 00:32:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1653 transitions. [2025-03-15 00:32:26,589 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4128371628371628 [2025-03-15 00:32:26,590 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 283 predicate places. [2025-03-15 00:32:26,590 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 5785 transitions, 296423 flow [2025-03-15 00:32:26,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 50.8125) internal successors, (813), 16 states have internal predecessors, (813), 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:32:26,590 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:26,590 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:26,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 00:32:26,591 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:32:26,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash -566391404, now seen corresponding path program 1 times [2025-03-15 00:32:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:26,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342243442] [2025-03-15 00:32:26,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:32:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:32:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:32:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342243442] [2025-03-15 00:32:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342243442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:26,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:32:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591555340] [2025-03-15 00:32:26,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:26,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:32:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:26,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:32:26,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:32:26,768 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:32:26,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 5785 transitions, 296423 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:32:26,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:26,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:32:26,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:03,242 INFO L124 PetriNetUnfolderBase]: 10652/25263 cut-off events. [2025-03-15 00:33:03,242 INFO L125 PetriNetUnfolderBase]: For 1007390/1014983 co-relation queries the response was YES. [2025-03-15 00:33:03,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539538 conditions, 25263 events. 10652/25263 cut-off events. For 1007390/1014983 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 223757 event pairs, 1257 based on Foata normal form. 128/24016 useless extension candidates. Maximal degree in co-relation 537528. Up to 13807 conditions per place. [2025-03-15 00:33:03,598 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 4776 selfloop transitions, 95 changer transitions 63/5034 dead transitions. [2025-03-15 00:33:03,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 5034 transitions, 267251 flow [2025-03-15 00:33:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:33:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:33:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 818 transitions. [2025-03-15 00:33:03,599 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4993894993894994 [2025-03-15 00:33:03,599 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 281 predicate places. [2025-03-15 00:33:03,600 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 5034 transitions, 267251 flow [2025-03-15 00:33:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:33:03,600 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:03,600 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:03,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 00:33:03,600 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:33:03,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1292112570, now seen corresponding path program 17 times [2025-03-15 00:33:03,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:03,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669986118] [2025-03-15 00:33:03,601 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:33:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:03,615 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:33:03,616 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:33:04,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:33:04,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669986118] [2025-03-15 00:33:04,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669986118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:33:04,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186014998] [2025-03-15 00:33:04,265 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:33:04,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:33:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:33:04,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:33:04,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 00:33:04,430 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:33:04,430 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:04,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-15 00:33:04,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:33:04,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 00:33:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:33:04,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:33:04,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186014998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:33:04,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:33:04,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-15 00:33:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708512959] [2025-03-15 00:33:04,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:33:04,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:33:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:33:04,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:33:04,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-15 00:33:04,657 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:33:04,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 5034 transitions, 267251 flow. Second operand has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:33:04,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:33:04,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:33:04,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:36,735 INFO L124 PetriNetUnfolderBase]: 10653/25279 cut-off events. [2025-03-15 00:33:36,735 INFO L125 PetriNetUnfolderBase]: For 1089459/1097484 co-relation queries the response was YES. [2025-03-15 00:33:36,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560030 conditions, 25279 events. 10653/25279 cut-off events. For 1089459/1097484 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 223990 event pairs, 1286 based on Foata normal form. 73/23978 useless extension candidates. Maximal degree in co-relation 557945. Up to 13818 conditions per place. [2025-03-15 00:33:37,138 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 4754 selfloop transitions, 130 changer transitions 63/5047 dead transitions. [2025-03-15 00:33:37,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 5047 transitions, 277849 flow [2025-03-15 00:33:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:33:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:33:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 865 transitions. [2025-03-15 00:33:37,140 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2025-03-15 00:33:37,140 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 290 predicate places. [2025-03-15 00:33:37,140 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 5047 transitions, 277849 flow [2025-03-15 00:33:37,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:33:37,141 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:37,141 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:37,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 00:33:37,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:33:37,342 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:33:37,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1829117840, now seen corresponding path program 18 times [2025-03-15 00:33:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:37,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335288835] [2025-03-15 00:33:37,343 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:33:37,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:37,355 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:33:37,356 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:33:37,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:33:37,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335288835] [2025-03-15 00:33:37,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335288835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:33:37,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:33:37,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:33:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146176385] [2025-03-15 00:33:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:33:37,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:33:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:33:37,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:33:37,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:33:37,496 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:33:37,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 5047 transitions, 277849 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:33:37,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:33:37,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:33:37,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:12,413 INFO L124 PetriNetUnfolderBase]: 10685/25389 cut-off events. [2025-03-15 00:34:12,414 INFO L125 PetriNetUnfolderBase]: For 1183204/1191799 co-relation queries the response was YES. [2025-03-15 00:34:12,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582684 conditions, 25389 events. 10685/25389 cut-off events. For 1183204/1191799 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 225390 event pairs, 1286 based on Foata normal form. 99/24114 useless extension candidates. Maximal degree in co-relation 580524. Up to 13880 conditions per place. [2025-03-15 00:34:12,872 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 4813 selfloop transitions, 105 changer transitions 63/5081 dead transitions. [2025-03-15 00:34:12,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 5081 transitions, 289715 flow [2025-03-15 00:34:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:34:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:34:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 816 transitions. [2025-03-15 00:34:12,874 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4981684981684982 [2025-03-15 00:34:12,875 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 298 predicate places. [2025-03-15 00:34:12,875 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 5081 transitions, 289715 flow [2025-03-15 00:34:12,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:34:12,875 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:12,875 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:12,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 00:34:12,875 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:34:12,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1379327492, now seen corresponding path program 19 times [2025-03-15 00:34:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:12,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702649144] [2025-03-15 00:34:12,877 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:34:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:34:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702649144] [2025-03-15 00:34:13,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702649144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:13,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:13,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:34:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063360839] [2025-03-15 00:34:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:13,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:34:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:13,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:34:13,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:34:13,108 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:34:13,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 5081 transitions, 289715 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:34:13,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:13,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:34:13,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:44,648 INFO L124 PetriNetUnfolderBase]: 10685/25408 cut-off events. [2025-03-15 00:34:44,649 INFO L125 PetriNetUnfolderBase]: For 1270884/1279839 co-relation queries the response was YES. [2025-03-15 00:34:44,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603280 conditions, 25408 events. 10685/25408 cut-off events. For 1270884/1279839 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 225683 event pairs, 1286 based on Foata normal form. 85/24119 useless extension candidates. Maximal degree in co-relation 601045. Up to 13890 conditions per place. [2025-03-15 00:34:45,210 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 4746 selfloop transitions, 185 changer transitions 63/5094 dead transitions. [2025-03-15 00:34:45,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 5094 transitions, 300459 flow [2025-03-15 00:34:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:34:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:34:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 801 transitions. [2025-03-15 00:34:45,212 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.489010989010989 [2025-03-15 00:34:45,212 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 306 predicate places. [2025-03-15 00:34:45,212 INFO L471 AbstractCegarLoop]: Abstraction has has 489 places, 5094 transitions, 300459 flow [2025-03-15 00:34:45,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:34:45,213 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:45,213 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:45,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 00:34:45,213 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:34:45,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash -409277098, now seen corresponding path program 20 times [2025-03-15 00:34:45,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:45,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295668790] [2025-03-15 00:34:45,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:34:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:45,225 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:34:45,225 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:34:45,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295668790] [2025-03-15 00:34:45,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295668790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:45,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:45,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:34:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833359481] [2025-03-15 00:34:45,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:45,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:34:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:45,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:34:45,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:34:45,340 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:34:45,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 5094 transitions, 300459 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:34:45,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:45,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:34:45,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:16,259 INFO L124 PetriNetUnfolderBase]: 9982/23816 cut-off events. [2025-03-15 00:35:16,259 INFO L125 PetriNetUnfolderBase]: For 1269956/1279052 co-relation queries the response was YES. [2025-03-15 00:35:16,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585272 conditions, 23816 events. 9982/23816 cut-off events. For 1269956/1279052 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 209376 event pairs, 1211 based on Foata normal form. 105/22640 useless extension candidates. Maximal degree in co-relation 582962. Up to 12946 conditions per place. [2025-03-15 00:35:16,642 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 4374 selfloop transitions, 119 changer transitions 63/4655 dead transitions. [2025-03-15 00:35:16,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 4655 transitions, 282965 flow [2025-03-15 00:35:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:35:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:35:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 799 transitions. [2025-03-15 00:35:16,644 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4877899877899878 [2025-03-15 00:35:16,644 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 314 predicate places. [2025-03-15 00:35:16,644 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 4655 transitions, 282965 flow [2025-03-15 00:35:16,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:35:16,644 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:16,645 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:16,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 00:35:16,645 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:35:16,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:16,645 INFO L85 PathProgramCache]: Analyzing trace with hash 951479518, now seen corresponding path program 21 times [2025-03-15 00:35:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:16,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142873701] [2025-03-15 00:35:16,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:35:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:16,658 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:35:16,658 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:35:16,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:16,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142873701] [2025-03-15 00:35:16,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142873701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:16,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:16,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:35:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799368989] [2025-03-15 00:35:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:16,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:35:16,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:16,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:35:16,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:35:16,805 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:35:16,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 4655 transitions, 282965 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:35:16,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:16,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:35:16,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:45,808 INFO L124 PetriNetUnfolderBase]: 10012/23901 cut-off events. [2025-03-15 00:35:45,809 INFO L125 PetriNetUnfolderBase]: For 1361568/1371047 co-relation queries the response was YES. [2025-03-15 00:35:45,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606444 conditions, 23901 events. 10012/23901 cut-off events. For 1361568/1371047 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 210263 event pairs, 1212 based on Foata normal form. 87/22707 useless extension candidates. Maximal degree in co-relation 604059. Up to 13009 conditions per place. [2025-03-15 00:35:46,218 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 4358 selfloop transitions, 165 changer transitions 63/4685 dead transitions. [2025-03-15 00:35:46,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 4685 transitions, 293985 flow [2025-03-15 00:35:46,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:35:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:35:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 820 transitions. [2025-03-15 00:35:46,220 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5006105006105006 [2025-03-15 00:35:46,220 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 322 predicate places. [2025-03-15 00:35:46,220 INFO L471 AbstractCegarLoop]: Abstraction has has 505 places, 4685 transitions, 293985 flow [2025-03-15 00:35:46,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:35:46,220 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:46,220 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:46,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 00:35:46,221 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:35:46,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash -941538530, now seen corresponding path program 22 times [2025-03-15 00:35:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:46,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928738454] [2025-03-15 00:35:46,221 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:35:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:46,237 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:35:46,237 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:35:46,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928738454] [2025-03-15 00:35:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928738454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:46,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:35:46,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44374476] [2025-03-15 00:35:46,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:46,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:35:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:46,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:35:46,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:35:46,729 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:35:46,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 4685 transitions, 293985 flow. Second operand has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:35:46,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:46,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:35:46,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:15,444 INFO L124 PetriNetUnfolderBase]: 10012/23917 cut-off events. [2025-03-15 00:36:15,444 INFO L125 PetriNetUnfolderBase]: For 1448640/1458325 co-relation queries the response was YES. [2025-03-15 00:36:15,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625943 conditions, 23917 events. 10012/23917 cut-off events. For 1448640/1458325 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 210661 event pairs, 1238 based on Foata normal form. 86/22723 useless extension candidates. Maximal degree in co-relation 623483. Up to 13020 conditions per place. [2025-03-15 00:36:16,030 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 4366 selfloop transitions, 170 changer transitions 63/4698 dead transitions. [2025-03-15 00:36:16,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 4698 transitions, 304017 flow [2025-03-15 00:36:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:36:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:36:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 865 transitions. [2025-03-15 00:36:16,031 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2025-03-15 00:36:16,032 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 331 predicate places. [2025-03-15 00:36:16,032 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 4698 transitions, 304017 flow [2025-03-15 00:36:16,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:36:16,032 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:16,032 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:16,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 00:36:16,032 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:36:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 701471282, now seen corresponding path program 23 times [2025-03-15 00:36:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29351794] [2025-03-15 00:36:16,033 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:36:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:16,048 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:36:16,048 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:36:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:36:16,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29351794] [2025-03-15 00:36:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29351794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:36:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594111048] [2025-03-15 00:36:16,520 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:36:16,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:36:16,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:36:16,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:36:16,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 00:36:16,672 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:36:16,672 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:36:16,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-15 00:36:16,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:36:16,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 00:36:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:36:16,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:36:16,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594111048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:16,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:36:16,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-15 00:36:16,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888038498] [2025-03-15 00:36:16,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:16,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:36:16,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:16,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:36:16,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-15 00:36:16,883 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:36:16,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 4698 transitions, 304017 flow. Second operand has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:36:16,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:16,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:36:16,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:48,708 INFO L124 PetriNetUnfolderBase]: 9883/23659 cut-off events. [2025-03-15 00:36:48,708 INFO L125 PetriNetUnfolderBase]: For 1526657/1536753 co-relation queries the response was YES. [2025-03-15 00:36:48,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637660 conditions, 23659 events. 9883/23659 cut-off events. For 1526657/1536753 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 209434 event pairs, 1189 based on Foata normal form. 103/22489 useless extension candidates. Maximal degree in co-relation 635125. Up to 12882 conditions per place. [2025-03-15 00:36:49,127 INFO L140 encePairwiseOnDemand]: 165/182 looper letters, 4242 selfloop transitions, 168 changer transitions 63/4571 dead transitions. [2025-03-15 00:36:49,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 4571 transitions, 304497 flow [2025-03-15 00:36:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:36:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:36:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1048 transitions. [2025-03-15 00:36:49,129 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4429416737109045 [2025-03-15 00:36:49,129 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 343 predicate places. [2025-03-15 00:36:49,129 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 4571 transitions, 304497 flow [2025-03-15 00:36:49,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:36:49,130 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:49,130 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 00:36:49,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-15 00:36:49,330 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:36:49,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:49,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1209228178, now seen corresponding path program 5 times [2025-03-15 00:36:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:49,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240247375] [2025-03-15 00:36:49,331 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:36:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:49,345 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:36:49,346 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:36:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:36:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:49,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240247375] [2025-03-15 00:36:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240247375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:36:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136729681] [2025-03-15 00:36:49,754 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:36:49,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:36:49,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:36:49,755 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:36:49,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-15 00:36:49,896 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:36:49,897 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:36:49,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-15 00:36:49,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:36:50,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 00:36:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:36:50,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:36:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136729681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:50,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:36:50,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-15 00:36:50,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369761967] [2025-03-15 00:36:50,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:50,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:36:50,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:50,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:36:50,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:36:50,090 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:36:50,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 4571 transitions, 304497 flow. Second operand has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:36:50,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:50,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:36:50,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:23,614 INFO L124 PetriNetUnfolderBase]: 10649/25501 cut-off events. [2025-03-15 00:37:23,614 INFO L125 PetriNetUnfolderBase]: For 1750100/1760885 co-relation queries the response was YES. [2025-03-15 00:37:23,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706475 conditions, 25501 events. 10649/25501 cut-off events. For 1750100/1760885 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 229417 event pairs, 1177 based on Foata normal form. 60/24193 useless extension candidates. Maximal degree in co-relation 703865. Up to 13833 conditions per place. [2025-03-15 00:37:24,089 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 4717 selfloop transitions, 316 changer transitions 63/5194 dead transitions. [2025-03-15 00:37:24,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 5194 transitions, 356849 flow [2025-03-15 00:37:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:37:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:37:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 796 transitions. [2025-03-15 00:37:24,091 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.43736263736263736 [2025-03-15 00:37:24,091 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 352 predicate places. [2025-03-15 00:37:24,091 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 5194 transitions, 356849 flow [2025-03-15 00:37:24,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 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:37:24,092 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:24,092 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:24,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-15 00:37:24,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-15 00:37:24,293 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:37:24,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1341188096, now seen corresponding path program 24 times [2025-03-15 00:37:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:24,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793255708] [2025-03-15 00:37:24,294 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:37:24,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:24,307 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:37:24,307 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:24,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:24,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793255708] [2025-03-15 00:37:24,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793255708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:24,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:24,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:37:24,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367710535] [2025-03-15 00:37:24,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:24,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:37:24,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:24,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:37:24,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:37:24,443 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:37:24,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 5194 transitions, 356849 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:37:24,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:24,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:37:24,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:11,426 INFO L124 PetriNetUnfolderBase]: 11505/27530 cut-off events. [2025-03-15 00:38:11,426 INFO L125 PetriNetUnfolderBase]: For 2017791/2029366 co-relation queries the response was YES. [2025-03-15 00:38:11,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783789 conditions, 27530 events. 11505/27530 cut-off events. For 2017791/2029366 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 249958 event pairs, 1220 based on Foata normal form. 67/26134 useless extension candidates. Maximal degree in co-relation 781104. Up to 15007 conditions per place. [2025-03-15 00:38:11,938 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 5371 selfloop transitions, 215 changer transitions 63/5747 dead transitions. [2025-03-15 00:38:11,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 5747 transitions, 407033 flow [2025-03-15 00:38:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:38:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:38:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 772 transitions. [2025-03-15 00:38:11,939 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4713064713064713 [2025-03-15 00:38:11,939 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 360 predicate places. [2025-03-15 00:38:11,940 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 5747 transitions, 407033 flow [2025-03-15 00:38:11,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:38:11,940 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:11,940 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:11,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-15 00:38:11,940 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:38:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash -28687620, now seen corresponding path program 25 times [2025-03-15 00:38:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438179746] [2025-03-15 00:38:11,941 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:38:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:38:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:38:12,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438179746] [2025-03-15 00:38:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438179746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:38:12,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:38:12,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:38:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636823489] [2025-03-15 00:38:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:12,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:38:12,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:12,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:38:12,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:38:12,109 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:38:12,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 5747 transitions, 407033 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:38:12,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:12,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:38:12,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:07,060 INFO L124 PetriNetUnfolderBase]: 11502/27537 cut-off events. [2025-03-15 00:39:07,061 INFO L125 PetriNetUnfolderBase]: For 2130553/2142610 co-relation queries the response was YES. [2025-03-15 00:39:07,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806023 conditions, 27537 events. 11502/27537 cut-off events. For 2130553/2142610 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 250087 event pairs, 1227 based on Foata normal form. 78/26152 useless extension candidates. Maximal degree in co-relation 803263. Up to 15014 conditions per place. [2025-03-15 00:39:07,625 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 5380 selfloop transitions, 219 changer transitions 63/5760 dead transitions. [2025-03-15 00:39:07,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 5760 transitions, 419295 flow [2025-03-15 00:39:07,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:39:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:39:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 770 transitions. [2025-03-15 00:39:07,626 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4700854700854701 [2025-03-15 00:39:07,627 INFO L298 CegarLoopForPetriNet]: 183 programPoint places, 368 predicate places. [2025-03-15 00:39:07,627 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 5760 transitions, 419295 flow [2025-03-15 00:39:07,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:39:07,628 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:07,629 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:07,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-15 00:39:07,629 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:39:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1930990008, now seen corresponding path program 26 times [2025-03-15 00:39:07,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:07,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558868164] [2025-03-15 00:39:07,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:39:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:07,646 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:39:07,647 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:39:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:39:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:07,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558868164] [2025-03-15 00:39:07,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558868164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:07,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:07,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:39:07,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435974501] [2025-03-15 00:39:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:07,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:39:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:07,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:39:07,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:39:07,929 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 182 [2025-03-15 00:39:07,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 5760 transitions, 419295 flow. Second operand has 9 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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:39:07,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:07,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 182 [2025-03-15 00:39:07,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 00:39:32,582 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 00:39:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:39:32,587 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-03-15 00:39:32,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-15 00:39:32,588 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 47/182 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 372621 conditions, 11972 events (4765/11971 cut-off events. For 956697/961002 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 107156 event pairs, 204 based on Foata normal form. 92/12002 useless extension candidates. Maximal degree in co-relation 369786. Up to 6199 conditions per place.). [2025-03-15 00:39:32,590 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-15 00:39:32,590 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-15 00:39:32,590 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-15 00:39:32,590 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-15 00:39:32,590 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-15 00:39:32,590 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-15 00:39:32,590 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-15 00:39:32,590 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-15 00:39:32,590 INFO L422 BasicCegarLoop]: Path program histogram: [26, 5, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-15 00:39:32,604 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:39:32,604 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:39:32,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:39:32 BasicIcfg [2025-03-15 00:39:32,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:39:32,616 INFO L158 Benchmark]: Toolchain (without parser) took 824157.14ms. Allocated memory was 71.3MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 43.0MB in the beginning and 766.2MB in the end (delta: -723.2MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-03-15 00:39:32,616 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:39:32,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.65ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 36.9MB in the end (delta: 5.9MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. [2025-03-15 00:39:32,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.43ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 33.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:39:32,617 INFO L158 Benchmark]: Boogie Preprocessor took 33.12ms. Allocated memory is still 71.3MB. Free memory was 33.8MB in the beginning and 31.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:39:32,617 INFO L158 Benchmark]: RCFGBuilder took 437.73ms. Allocated memory is still 71.3MB. Free memory was 31.9MB in the beginning and 33.0MB in the end (delta: -1.1MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. [2025-03-15 00:39:32,617 INFO L158 Benchmark]: TraceAbstraction took 823162.39ms. Allocated memory was 71.3MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 32.0MB in the beginning and 766.2MB in the end (delta: -734.2MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-03-15 00:39:32,621 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 467.65ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 36.9MB in the end (delta: 5.9MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.43ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 33.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.12ms. Allocated memory is still 71.3MB. Free memory was 33.8MB in the beginning and 31.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 437.73ms. Allocated memory is still 71.3MB. Free memory was 31.9MB in the beginning and 33.0MB in the end (delta: -1.1MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. * TraceAbstraction took 823162.39ms. Allocated memory was 71.3MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 32.0MB in the beginning and 766.2MB in the end (delta: -734.2MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 47/182 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 372621 conditions, 11972 events (4765/11971 cut-off events. For 956697/961002 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 107156 event pairs, 204 based on Foata normal form. 92/12002 useless extension candidates. Maximal degree in co-relation 369786. Up to 6199 conditions per place.). - TimeoutResultAtElement [Line: 939]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 47/182 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 372621 conditions, 11972 events (4765/11971 cut-off events. For 956697/961002 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 107156 event pairs, 204 based on Foata normal form. 92/12002 useless extension candidates. Maximal degree in co-relation 369786. Up to 6199 conditions per place.). - TimeoutResultAtElement [Line: 939]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 47/182 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 372621 conditions, 11972 events (4765/11971 cut-off events. For 956697/961002 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 107156 event pairs, 204 based on Foata normal form. 92/12002 useless extension candidates. Maximal degree in co-relation 369786. Up to 6199 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 47/182 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 372621 conditions, 11972 events (4765/11971 cut-off events. For 956697/961002 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 107156 event pairs, 204 based on Foata normal form. 92/12002 useless extension candidates. Maximal degree in co-relation 369786. Up to 6199 conditions per place.). - TimeoutResultAtElement [Line: 936]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 47/182 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 372621 conditions, 11972 events (4765/11971 cut-off events. For 956697/961002 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 107156 event pairs, 204 based on Foata normal form. 92/12002 useless extension candidates. Maximal degree in co-relation 369786. Up to 6199 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 47/182 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 372621 conditions, 11972 events (4765/11971 cut-off events. For 956697/961002 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 107156 event pairs, 204 based on Foata normal form. 92/12002 useless extension candidates. Maximal degree in co-relation 369786. Up to 6199 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 47/182 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 372621 conditions, 11972 events (4765/11971 cut-off events. For 956697/961002 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 107156 event pairs, 204 based on Foata normal form. 92/12002 useless extension candidates. Maximal degree in co-relation 369786. Up to 6199 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 219 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 823.0s, OverallIterations: 42, TraceHistogramMax: 10, PathProgramHistogramMax: 26, EmptinessCheckTime: 0.0s, AutomataDifference: 805.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11665 SdHoareTripleChecker+Valid, 18.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11665 mSDsluCounter, 29711 SdHoareTripleChecker+Invalid, 14.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22841 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31905 IncrementalHoareTripleChecker+Invalid, 32169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 6870 mSDtfsCounter, 31905 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2205 GetRequests, 1569 SyntacticMatches, 11 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=419295occurred in iteration=41, InterpolantAutomatonStates: 431, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 7505 NumberOfCodeBlocks, 6655 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 7784 ConstructedInterpolants, 0 QuantifiedInterpolants, 19314 SizeOfPredicates, 72 NumberOfNonLiveVariables, 2736 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 54 InterpolantComputations, 39 PerfectInterpolantSequences, 9391/9925 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown