/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/09-regions_17-arrayloop_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:37:21,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:37:21,853 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:37:21,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:37:21,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:37:21,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:37:21,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:37:21,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:37:21,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:37:21,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:37:21,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:37:21,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:37:21,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:37:21,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:37:21,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:37:21,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:37:21,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:37:21,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:37:21,871 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:37:22,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:37:22,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:37:22,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:37:22,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:37:22,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:37:22,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-15 00:37:23,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef754524/639bd178572c4410be725f858908d79c/FLAG0134d3b43 [2025-03-15 00:37:23,569 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:37:23,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-15 00:37:23,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef754524/639bd178572c4410be725f858908d79c/FLAG0134d3b43 [2025-03-15 00:37:23,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef754524/639bd178572c4410be725f858908d79c [2025-03-15 00:37:23,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:37:23,604 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:37:23,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:37:23,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:37:23,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:37:23,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:37:23" (1/1) ... [2025-03-15 00:37:23,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5d41b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:23, skipping insertion in model container [2025-03-15 00:37:23,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:37:23" (1/1) ... [2025-03-15 00:37:23,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:37:24,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:37:24,083 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:37:24,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:37:24,214 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:37:24,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24 WrapperNode [2025-03-15 00:37:24,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:37:24,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:37:24,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:37:24,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:37:24,221 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:37:24" (1/1) ... [2025-03-15 00:37:24,244 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:37:24" (1/1) ... [2025-03-15 00:37:24,299 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 283 [2025-03-15 00:37:24,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:37:24,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:37:24,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:37:24,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:37:24,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:37:24,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:37:24,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:37:24,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:37:24,354 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (1/1) ... [2025-03-15 00:37:24,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:37:24,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:24,384 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:37:24,386 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:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:37:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:37:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:37:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:37:24,405 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:37:24,506 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:37:24,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:37:24,916 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:37:24,917 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:37:24,945 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:37:24,945 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:37:24,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:37:24 BoogieIcfgContainer [2025-03-15 00:37:24,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:37:24,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:37:24,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:37:24,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:37:24,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:37:23" (1/3) ... [2025-03-15 00:37:24,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db967eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:37:24, skipping insertion in model container [2025-03-15 00:37:24,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:24" (2/3) ... [2025-03-15 00:37:24,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db967eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:37:24, skipping insertion in model container [2025-03-15 00:37:24,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:37:24" (3/3) ... [2025-03-15 00:37:24,954 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-03-15 00:37:24,966 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:37:24,968 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 319 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-03-15 00:37:24,969 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:37:25,045 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:37:25,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:37:25,095 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;@497b8836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:37:25,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-15 00:37:25,152 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:37:25,152 INFO L124 PetriNetUnfolderBase]: 0/120 cut-off events. [2025-03-15 00:37:25,153 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:37:25,154 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:25,155 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] [2025-03-15 00:37:25,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:25,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash -154656294, now seen corresponding path program 1 times [2025-03-15 00:37:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507067917] [2025-03-15 00:37:25,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:25,955 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:37:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507067917] [2025-03-15 00:37:25,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507067917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:25,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:25,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741432887] [2025-03-15 00:37:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:25,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:25,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:25,987 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 321 [2025-03-15 00:37:25,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 321 transitions, 646 flow. Second operand has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 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:25,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:25,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 321 [2025-03-15 00:37:25,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:27,763 INFO L124 PetriNetUnfolderBase]: 2726/8126 cut-off events. [2025-03-15 00:37:27,764 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:37:27,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13603 conditions, 8126 events. 2726/8126 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 61101 event pairs, 2218 based on Foata normal form. 0/7218 useless extension candidates. Maximal degree in co-relation 13452. Up to 5160 conditions per place. [2025-03-15 00:37:27,818 INFO L140 encePairwiseOnDemand]: 284/321 looper letters, 178 selfloop transitions, 107 changer transitions 0/476 dead transitions. [2025-03-15 00:37:27,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 476 transitions, 1525 flow [2025-03-15 00:37:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1439 transitions. [2025-03-15 00:37:27,833 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7471443406022845 [2025-03-15 00:37:27,835 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 3 predicate places. [2025-03-15 00:37:27,835 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 476 transitions, 1525 flow [2025-03-15 00:37:27,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 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:27,836 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:27,836 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:27,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:37:27,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:27,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1765553760, now seen corresponding path program 1 times [2025-03-15 00:37:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619288350] [2025-03-15 00:37:27,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:28,224 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:37:28,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:28,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619288350] [2025-03-15 00:37:28,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619288350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:28,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:28,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003440160] [2025-03-15 00:37:28,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:28,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:28,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:28,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:28,227 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 321 [2025-03-15 00:37:28,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 476 transitions, 1525 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 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:28,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:28,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 321 [2025-03-15 00:37:28,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:29,720 INFO L124 PetriNetUnfolderBase]: 2993/8755 cut-off events. [2025-03-15 00:37:29,720 INFO L125 PetriNetUnfolderBase]: For 687/1198 co-relation queries the response was YES. [2025-03-15 00:37:29,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20539 conditions, 8755 events. 2993/8755 cut-off events. For 687/1198 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 66440 event pairs, 2080 based on Foata normal form. 0/7805 useless extension candidates. Maximal degree in co-relation 20364. Up to 5577 conditions per place. [2025-03-15 00:37:29,764 INFO L140 encePairwiseOnDemand]: 284/321 looper letters, 333 selfloop transitions, 107 changer transitions 0/632 dead transitions. [2025-03-15 00:37:29,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 632 transitions, 3027 flow [2025-03-15 00:37:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1438 transitions. [2025-03-15 00:37:29,768 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7466251298026999 [2025-03-15 00:37:29,769 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 7 predicate places. [2025-03-15 00:37:29,769 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 632 transitions, 3027 flow [2025-03-15 00:37:29,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 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:29,769 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:29,770 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:29,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:37:29,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:29,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:29,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1264270578, now seen corresponding path program 1 times [2025-03-15 00:37:29,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:29,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923906979] [2025-03-15 00:37:29,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:29,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923906979] [2025-03-15 00:37:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923906979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:29,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:29,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:37:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178726533] [2025-03-15 00:37:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:29,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:37:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:29,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:37:29,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:37:29,880 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 321 [2025-03-15 00:37:29,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 632 transitions, 3027 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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:29,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:29,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 321 [2025-03-15 00:37:29,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:32,342 INFO L124 PetriNetUnfolderBase]: 5845/16265 cut-off events. [2025-03-15 00:37:32,342 INFO L125 PetriNetUnfolderBase]: For 2206/2741 co-relation queries the response was YES. [2025-03-15 00:37:32,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41304 conditions, 16265 events. 5845/16265 cut-off events. For 2206/2741 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 126755 event pairs, 4068 based on Foata normal form. 36/14565 useless extension candidates. Maximal degree in co-relation 41012. Up to 10948 conditions per place. [2025-03-15 00:37:32,413 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 102 selfloop transitions, 4 changer transitions 0/681 dead transitions. [2025-03-15 00:37:32,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 681 transitions, 3489 flow [2025-03-15 00:37:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:37:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:37:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-03-15 00:37:32,416 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9511941848390446 [2025-03-15 00:37:32,417 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 9 predicate places. [2025-03-15 00:37:32,417 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 681 transitions, 3489 flow [2025-03-15 00:37:32,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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:32,417 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:32,417 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:32,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:37:32,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:32,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash -469721372, now seen corresponding path program 1 times [2025-03-15 00:37:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016611971] [2025-03-15 00:37:32,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:32,817 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:37:32,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:32,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016611971] [2025-03-15 00:37:32,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016611971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:32,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:32,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833347771] [2025-03-15 00:37:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:32,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:32,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:32,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:32,819 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 321 [2025-03-15 00:37:32,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 681 transitions, 3489 flow. Second operand has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 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:32,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:32,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 321 [2025-03-15 00:37:32,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:35,596 INFO L124 PetriNetUnfolderBase]: 6636/17810 cut-off events. [2025-03-15 00:37:35,596 INFO L125 PetriNetUnfolderBase]: For 6782/8059 co-relation queries the response was YES. [2025-03-15 00:37:35,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57130 conditions, 17810 events. 6636/17810 cut-off events. For 6782/8059 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 137889 event pairs, 4718 based on Foata normal form. 0/15919 useless extension candidates. Maximal degree in co-relation 56785. Up to 12394 conditions per place. [2025-03-15 00:37:35,675 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 493 selfloop transitions, 9 changer transitions 0/679 dead transitions. [2025-03-15 00:37:35,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 679 transitions, 4477 flow [2025-03-15 00:37:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-03-15 00:37:35,679 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.622533748701973 [2025-03-15 00:37:35,680 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 13 predicate places. [2025-03-15 00:37:35,681 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 679 transitions, 4477 flow [2025-03-15 00:37:35,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 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:35,681 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:35,682 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:35,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:37:35,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:35,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash -690134643, now seen corresponding path program 1 times [2025-03-15 00:37:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:35,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73876854] [2025-03-15 00:37:35,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:35,817 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:37:35,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73876854] [2025-03-15 00:37:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73876854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861438879] [2025-03-15 00:37:35,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:35,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:35,820 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:37:35,822 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:37:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:35,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:37:35,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:37:36,025 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:37:36,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:36,100 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:37:36,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861438879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:37:36,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:37:36,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:37:36,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127810914] [2025-03-15 00:37:36,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:37:36,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:37:36,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:36,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:37:36,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:37:36,104 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 321 [2025-03-15 00:37:36,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 679 transitions, 4477 flow. Second operand has 10 states, 10 states have (on average 283.1) internal successors, (2831), 10 states have internal predecessors, (2831), 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:36,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:36,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 321 [2025-03-15 00:37:36,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:39,705 INFO L124 PetriNetUnfolderBase]: 6566/17469 cut-off events. [2025-03-15 00:37:39,706 INFO L125 PetriNetUnfolderBase]: For 9280/10368 co-relation queries the response was YES. [2025-03-15 00:37:39,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58755 conditions, 17469 events. 6566/17469 cut-off events. For 9280/10368 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 133412 event pairs, 4582 based on Foata normal form. 2/15626 useless extension candidates. Maximal degree in co-relation 58247. Up to 12342 conditions per place. [2025-03-15 00:37:39,769 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 107 selfloop transitions, 13 changer transitions 0/694 dead transitions. [2025-03-15 00:37:39,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 694 transitions, 4827 flow [2025-03-15 00:37:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:37:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:37:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2601 transitions. [2025-03-15 00:37:39,773 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9003115264797508 [2025-03-15 00:37:39,775 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 21 predicate places. [2025-03-15 00:37:39,775 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 694 transitions, 4827 flow [2025-03-15 00:37:39,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 283.1) internal successors, (2831), 10 states have internal predecessors, (2831), 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:39,776 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:39,776 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:39,785 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:37:39,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:39,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:39,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1929845971, now seen corresponding path program 2 times [2025-03-15 00:37:39,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:39,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191983511] [2025-03-15 00:37:39,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:37:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:40,014 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:37:40,014 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-15 00:37:40,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:40,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191983511] [2025-03-15 00:37:40,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191983511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:40,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:40,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:40,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586200470] [2025-03-15 00:37:40,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:40,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:40,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:40,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:40,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:40,209 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 321 [2025-03-15 00:37:40,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 694 transitions, 4827 flow. Second operand has 6 states, 6 states have (on average 204.33333333333334) internal successors, (1226), 6 states have internal predecessors, (1226), 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:40,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:40,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 321 [2025-03-15 00:37:40,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:44,791 INFO L124 PetriNetUnfolderBase]: 8294/21558 cut-off events. [2025-03-15 00:37:44,792 INFO L125 PetriNetUnfolderBase]: For 18214/20824 co-relation queries the response was YES. [2025-03-15 00:37:44,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85685 conditions, 21558 events. 8294/21558 cut-off events. For 18214/20824 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 167157 event pairs, 4925 based on Foata normal form. 0/19468 useless extension candidates. Maximal degree in co-relation 85130. Up to 14628 conditions per place. [2025-03-15 00:37:44,899 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 565 selfloop transitions, 210 changer transitions 0/995 dead transitions. [2025-03-15 00:37:44,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 995 transitions, 9227 flow [2025-03-15 00:37:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1548 transitions. [2025-03-15 00:37:44,903 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8037383177570093 [2025-03-15 00:37:44,904 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 26 predicate places. [2025-03-15 00:37:44,904 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 995 transitions, 9227 flow [2025-03-15 00:37:44,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.33333333333334) internal successors, (1226), 6 states have internal predecessors, (1226), 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:44,905 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:44,905 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:44,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:37:44,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:44,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2060109134, now seen corresponding path program 1 times [2025-03-15 00:37:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147749769] [2025-03-15 00:37:44,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147749769] [2025-03-15 00:37:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147749769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958559098] [2025-03-15 00:37:45,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:45,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:45,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:45,216 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:37:45,217 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:37:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:45,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:37:45,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:37:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:45,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958559098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:37:45,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:37:45,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:37:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176389655] [2025-03-15 00:37:45,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:37:45,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:37:45,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:45,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:37:45,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:37:45,758 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 321 [2025-03-15 00:37:45,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 995 transitions, 9227 flow. Second operand has 18 states, 18 states have (on average 283.72222222222223) internal successors, (5107), 18 states have internal predecessors, (5107), 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:45,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:45,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 321 [2025-03-15 00:37:45,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:51,489 INFO L124 PetriNetUnfolderBase]: 8294/21722 cut-off events. [2025-03-15 00:37:51,489 INFO L125 PetriNetUnfolderBase]: For 23812/26473 co-relation queries the response was YES. [2025-03-15 00:37:51,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88988 conditions, 21722 events. 8294/21722 cut-off events. For 23812/26473 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 167372 event pairs, 4925 based on Foata normal form. 8/19640 useless extension candidates. Maximal degree in co-relation 87769. Up to 14696 conditions per place. [2025-03-15 00:37:51,585 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 251 selfloop transitions, 25 changer transitions 0/1039 dead transitions. [2025-03-15 00:37:51,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 1039 transitions, 10235 flow [2025-03-15 00:37:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:37:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:37:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5995 transitions. [2025-03-15 00:37:51,592 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8893339267171043 [2025-03-15 00:37:51,592 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 46 predicate places. [2025-03-15 00:37:51,592 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 1039 transitions, 10235 flow [2025-03-15 00:37:51,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 283.72222222222223) internal successors, (5107), 18 states have internal predecessors, (5107), 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:51,594 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:51,595 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:51,601 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:37:51,795 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,SelfDestructingSolverStorable6 [2025-03-15 00:37:51,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:51,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1584170482, now seen corresponding path program 2 times [2025-03-15 00:37:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:51,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417579413] [2025-03-15 00:37:51,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:37:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:51,847 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:37:51,847 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2025-03-15 00:37:52,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:52,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417579413] [2025-03-15 00:37:52,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417579413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:52,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:52,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300392066] [2025-03-15 00:37:52,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:52,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:52,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:52,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:52,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:52,025 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 321 [2025-03-15 00:37:52,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 1039 transitions, 10235 flow. Second operand has 6 states, 6 states have (on average 205.33333333333334) internal successors, (1232), 6 states have internal predecessors, (1232), 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:52,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:52,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 321 [2025-03-15 00:37:52,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:59,206 INFO L124 PetriNetUnfolderBase]: 9305/24183 cut-off events. [2025-03-15 00:37:59,206 INFO L125 PetriNetUnfolderBase]: For 38205/43576 co-relation queries the response was YES. [2025-03-15 00:37:59,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114877 conditions, 24183 events. 9305/24183 cut-off events. For 38205/43576 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 188961 event pairs, 4662 based on Foata normal form. 0/21910 useless extension candidates. Maximal degree in co-relation 113551. Up to 16209 conditions per place. [2025-03-15 00:37:59,320 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 885 selfloop transitions, 210 changer transitions 0/1340 dead transitions. [2025-03-15 00:37:59,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1340 transitions, 16099 flow [2025-03-15 00:37:59,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1548 transitions. [2025-03-15 00:37:59,323 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8037383177570093 [2025-03-15 00:37:59,323 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 51 predicate places. [2025-03-15 00:37:59,323 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 1340 transitions, 16099 flow [2025-03-15 00:37:59,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.33333333333334) internal successors, (1232), 6 states have internal predecessors, (1232), 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:59,324 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:59,324 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:59,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:37:59,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:59,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -628600981, now seen corresponding path program 1 times [2025-03-15 00:37:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302135001] [2025-03-15 00:37:59,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:59,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:59,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302135001] [2025-03-15 00:37:59,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302135001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:59,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613767338] [2025-03-15 00:37:59,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:59,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:59,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:59,837 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:37:59,838 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:38:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:38:00,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:38:00,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:38:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:38:00,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:38:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:38:00,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613767338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:38:00,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:38:00,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 00:38:00,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594814624] [2025-03-15 00:38:00,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:38:00,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 00:38:00,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:00,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 00:38:00,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 00:38:00,656 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 321 [2025-03-15 00:38:00,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1340 transitions, 16099 flow. Second operand has 23 states, 23 states have (on average 284.30434782608694) internal successors, (6539), 23 states have internal predecessors, (6539), 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:00,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:00,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 321 [2025-03-15 00:38:00,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:08,708 INFO L124 PetriNetUnfolderBase]: 9235/23930 cut-off events. [2025-03-15 00:38:08,708 INFO L125 PetriNetUnfolderBase]: For 44481/49207 co-relation queries the response was YES. [2025-03-15 00:38:08,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117473 conditions, 23930 events. 9235/23930 cut-off events. For 44481/49207 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 184404 event pairs, 4583 based on Foata normal form. 8/21710 useless extension candidates. Maximal degree in co-relation 115517. Up to 16190 conditions per place. [2025-03-15 00:38:08,839 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 387 selfloop transitions, 34 changer transitions 0/1373 dead transitions. [2025-03-15 00:38:08,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 1373 transitions, 17379 flow [2025-03-15 00:38:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 00:38:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 00:38:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8538 transitions. [2025-03-15 00:38:08,848 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8866043613707165 [2025-03-15 00:38:08,848 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 80 predicate places. [2025-03-15 00:38:08,848 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 1373 transitions, 17379 flow [2025-03-15 00:38:08,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 284.30434782608694) internal successors, (6539), 23 states have internal predecessors, (6539), 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:08,850 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:08,850 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:38:08,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 00:38:09,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:38:09,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:38:09,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1276970590, now seen corresponding path program 2 times [2025-03-15 00:38:09,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:09,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090758730] [2025-03-15 00:38:09,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:38:09,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:09,111 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:38:09,111 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:38:09,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:09,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090758730] [2025-03-15 00:38:09,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090758730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:38:09,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:38:09,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:38:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420837609] [2025-03-15 00:38:09,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:09,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:38:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:09,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:38:09,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:38:09,376 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:38:09,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 1373 transitions, 17379 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:09,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:09,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:38:09,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:19,493 INFO L124 PetriNetUnfolderBase]: 11257/27399 cut-off events. [2025-03-15 00:38:19,493 INFO L125 PetriNetUnfolderBase]: For 76231/80904 co-relation queries the response was YES. [2025-03-15 00:38:19,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154927 conditions, 27399 events. 11257/27399 cut-off events. For 76231/80904 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 210391 event pairs, 3895 based on Foata normal form. 18/24975 useless extension candidates. Maximal degree in co-relation 152716. Up to 18441 conditions per place. [2025-03-15 00:38:19,816 INFO L140 encePairwiseOnDemand]: 280/321 looper letters, 1745 selfloop transitions, 138 changer transitions 0/2123 dead transitions. [2025-03-15 00:38:19,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 2123 transitions, 30187 flow [2025-03-15 00:38:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 00:38:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 00:38:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4619 transitions. [2025-03-15 00:38:19,823 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6256264391168902 [2025-03-15 00:38:19,824 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 102 predicate places. [2025-03-15 00:38:19,825 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 2123 transitions, 30187 flow [2025-03-15 00:38:19,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:19,825 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:19,825 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:38:19,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:38:19,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:38:19,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1608291268, now seen corresponding path program 3 times [2025-03-15 00:38:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:19,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792223458] [2025-03-15 00:38:19,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:38:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:19,926 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:38:19,926 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:38:20,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:20,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792223458] [2025-03-15 00:38:20,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792223458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:38:20,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:38:20,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:38:20,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927888261] [2025-03-15 00:38:20,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:20,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:38:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:20,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:38:20,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:38:20,421 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:38:20,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 2123 transitions, 30187 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:20,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:20,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:38:20,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:32,292 INFO L124 PetriNetUnfolderBase]: 11359/27505 cut-off events. [2025-03-15 00:38:32,292 INFO L125 PetriNetUnfolderBase]: For 93788/95437 co-relation queries the response was YES. [2025-03-15 00:38:32,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176813 conditions, 27505 events. 11359/27505 cut-off events. For 93788/95437 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 210861 event pairs, 3333 based on Foata normal form. 1/25072 useless extension candidates. Maximal degree in co-relation 174347. Up to 18551 conditions per place. [2025-03-15 00:38:32,470 INFO L140 encePairwiseOnDemand]: 273/321 looper letters, 1837 selfloop transitions, 289 changer transitions 0/2366 dead transitions. [2025-03-15 00:38:32,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 2366 transitions, 37353 flow [2025-03-15 00:38:32,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 00:38:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 00:38:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2616 transitions. [2025-03-15 00:38:32,473 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6791277258566978 [2025-03-15 00:38:32,473 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 113 predicate places. [2025-03-15 00:38:32,473 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 2366 transitions, 37353 flow [2025-03-15 00:38:32,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:32,474 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:32,474 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:38:32,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:38:32,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:38:32,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash 419886050, now seen corresponding path program 4 times [2025-03-15 00:38:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:32,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904064611] [2025-03-15 00:38:32,475 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:38:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:32,561 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:38:32,561 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:38:33,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:33,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904064611] [2025-03-15 00:38:33,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904064611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:38:33,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:38:33,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:38:33,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743832946] [2025-03-15 00:38:33,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:33,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:38:33,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:33,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:38:33,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:38:33,692 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:38:33,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 2366 transitions, 37353 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:33,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:33,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:38:33,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:47,015 INFO L124 PetriNetUnfolderBase]: 11473/27753 cut-off events. [2025-03-15 00:38:47,015 INFO L125 PetriNetUnfolderBase]: For 116735/119380 co-relation queries the response was YES. [2025-03-15 00:38:47,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199319 conditions, 27753 events. 11473/27753 cut-off events. For 116735/119380 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 213163 event pairs, 3335 based on Foata normal form. 47/25366 useless extension candidates. Maximal degree in co-relation 196598. Up to 18667 conditions per place. [2025-03-15 00:38:47,198 INFO L140 encePairwiseOnDemand]: 273/321 looper letters, 1877 selfloop transitions, 308 changer transitions 0/2425 dead transitions. [2025-03-15 00:38:47,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 2425 transitions, 42503 flow [2025-03-15 00:38:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:38:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:38:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2797 transitions. [2025-03-15 00:38:47,200 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6702612029714834 [2025-03-15 00:38:47,201 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 125 predicate places. [2025-03-15 00:38:47,201 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 2425 transitions, 42503 flow [2025-03-15 00:38:47,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:47,202 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:47,202 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:38:47,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:38:47,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:38:47,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1243676466, now seen corresponding path program 5 times [2025-03-15 00:38:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430246984] [2025-03-15 00:38:47,203 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:38:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:47,483 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:38:47,483 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:38:48,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:48,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430246984] [2025-03-15 00:38:48,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430246984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:38:48,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:38:48,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:38:48,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053652463] [2025-03-15 00:38:48,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:48,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:38:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:48,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:38:48,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:38:48,707 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:38:48,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 2425 transitions, 42503 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:48,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:48,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:38:48,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:03,109 INFO L124 PetriNetUnfolderBase]: 11679/28185 cut-off events. [2025-03-15 00:39:03,109 INFO L125 PetriNetUnfolderBase]: For 143772/147355 co-relation queries the response was YES. [2025-03-15 00:39:03,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223805 conditions, 28185 events. 11679/28185 cut-off events. For 143772/147355 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 216802 event pairs, 3361 based on Foata normal form. 47/25786 useless extension candidates. Maximal degree in co-relation 220829. Up to 18917 conditions per place. [2025-03-15 00:39:03,507 INFO L140 encePairwiseOnDemand]: 273/321 looper letters, 1946 selfloop transitions, 328 changer transitions 0/2514 dead transitions. [2025-03-15 00:39:03,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 2514 transitions, 48557 flow [2025-03-15 00:39:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:39:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:39:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3168 transitions. [2025-03-15 00:39:03,509 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6579439252336449 [2025-03-15 00:39:03,509 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 139 predicate places. [2025-03-15 00:39:03,510 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 2514 transitions, 48557 flow [2025-03-15 00:39:03,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:03,510 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:03,510 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:39:03,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:39:03,511 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:39:03,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash 850068032, now seen corresponding path program 6 times [2025-03-15 00:39:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689521548] [2025-03-15 00:39:03,512 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:39:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:03,560 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:39:03,560 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:39:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:39:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:03,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689521548] [2025-03-15 00:39:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689521548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:03,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:03,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:39:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020478177] [2025-03-15 00:39:03,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:03,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:39:03,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:03,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:39:03,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:39:03,795 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:39:03,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 2514 transitions, 48557 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:03,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:03,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:39:03,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:20,009 INFO L124 PetriNetUnfolderBase]: 12055/29160 cut-off events. [2025-03-15 00:39:20,009 INFO L125 PetriNetUnfolderBase]: For 180623/185436 co-relation queries the response was YES. [2025-03-15 00:39:20,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252132 conditions, 29160 events. 12055/29160 cut-off events. For 180623/185436 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 226083 event pairs, 3432 based on Foata normal form. 59/26721 useless extension candidates. Maximal degree in co-relation 248901. Up to 19327 conditions per place. [2025-03-15 00:39:20,208 INFO L140 encePairwiseOnDemand]: 274/321 looper letters, 2029 selfloop transitions, 419 changer transitions 0/2688 dead transitions. [2025-03-15 00:39:20,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 2688 transitions, 56547 flow [2025-03-15 00:39:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:39:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:39:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3131 transitions. [2025-03-15 00:39:20,210 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6502596053997923 [2025-03-15 00:39:20,211 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 153 predicate places. [2025-03-15 00:39:20,211 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 2688 transitions, 56547 flow [2025-03-15 00:39:20,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:20,212 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:20,212 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:39:20,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:39:20,212 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:39:20,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1415639732, now seen corresponding path program 7 times [2025-03-15 00:39:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753963797] [2025-03-15 00:39:20,214 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:39:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:39:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:39:21,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:21,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753963797] [2025-03-15 00:39:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753963797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:21,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:21,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:39:21,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889011053] [2025-03-15 00:39:21,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:21,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:39:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:21,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:39:21,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:39:21,469 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:39:21,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 2688 transitions, 56547 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:21,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:21,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:39:21,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:37,987 INFO L124 PetriNetUnfolderBase]: 12339/29746 cut-off events. [2025-03-15 00:39:37,987 INFO L125 PetriNetUnfolderBase]: For 219018/224791 co-relation queries the response was YES. [2025-03-15 00:39:38,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279967 conditions, 29746 events. 12339/29746 cut-off events. For 219018/224791 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 231331 event pairs, 3446 based on Foata normal form. 59/27287 useless extension candidates. Maximal degree in co-relation 276481. Up to 19701 conditions per place. [2025-03-15 00:39:38,244 INFO L140 encePairwiseOnDemand]: 274/321 looper letters, 2199 selfloop transitions, 443 changer transitions 0/2882 dead transitions. [2025-03-15 00:39:38,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 2882 transitions, 65907 flow [2025-03-15 00:39:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 00:39:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 00:39:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3327 transitions. [2025-03-15 00:39:38,247 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6477803738317757 [2025-03-15 00:39:38,247 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 168 predicate places. [2025-03-15 00:39:38,247 INFO L471 AbstractCegarLoop]: Abstraction has has 490 places, 2882 transitions, 65907 flow [2025-03-15 00:39:38,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:38,248 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:38,248 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:39:38,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:39:38,248 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:39:38,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:38,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1524093100, now seen corresponding path program 8 times [2025-03-15 00:39:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:38,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936226565] [2025-03-15 00:39:38,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:39:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:38,304 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:39:38,304 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:39:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:39:38,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936226565] [2025-03-15 00:39:38,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936226565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:38,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:38,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:39:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303676096] [2025-03-15 00:39:38,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:38,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:39:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:38,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:39:38,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:39:38,678 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:39:38,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 2882 transitions, 65907 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:38,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:38,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:39:38,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:56,351 INFO L124 PetriNetUnfolderBase]: 12493/30094 cut-off events. [2025-03-15 00:39:56,351 INFO L125 PetriNetUnfolderBase]: For 260708/267441 co-relation queries the response was YES. [2025-03-15 00:39:56,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306016 conditions, 30094 events. 12493/30094 cut-off events. For 260708/267441 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 234437 event pairs, 3450 based on Foata normal form. 59/27635 useless extension candidates. Maximal degree in co-relation 302275. Up to 19857 conditions per place. [2025-03-15 00:39:56,612 INFO L140 encePairwiseOnDemand]: 275/321 looper letters, 2254 selfloop transitions, 478 changer transitions 0/2972 dead transitions. [2025-03-15 00:39:56,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 2972 transitions, 73263 flow [2025-03-15 00:39:56,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:39:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:39:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2715 transitions. [2025-03-15 00:39:56,614 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6506110711718188 [2025-03-15 00:39:56,614 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 180 predicate places. [2025-03-15 00:39:56,614 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 2972 transitions, 73263 flow [2025-03-15 00:39:56,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:56,615 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:56,615 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:39:56,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:39:56,615 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:39:56,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1406625236, now seen corresponding path program 9 times [2025-03-15 00:39:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:56,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328694464] [2025-03-15 00:39:56,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:39:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:56,665 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:39:56,665 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:39:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:39:56,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:56,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328694464] [2025-03-15 00:39:56,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328694464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:56,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:56,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:39:56,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16449907] [2025-03-15 00:39:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:56,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:39:56,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:56,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:39:56,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:39:56,867 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:39:56,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 2972 transitions, 73263 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:56,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:56,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:39:56,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:40:17,953 INFO L124 PetriNetUnfolderBase]: 12945/31028 cut-off events. [2025-03-15 00:40:17,953 INFO L125 PetriNetUnfolderBase]: For 312373/320066 co-relation queries the response was YES. [2025-03-15 00:40:18,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339937 conditions, 31028 events. 12945/31028 cut-off events. For 312373/320066 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 242710 event pairs, 3468 based on Foata normal form. 59/28487 useless extension candidates. Maximal degree in co-relation 335941. Up to 20505 conditions per place. [2025-03-15 00:40:18,221 INFO L140 encePairwiseOnDemand]: 275/321 looper letters, 2388 selfloop transitions, 544 changer transitions 0/3172 dead transitions. [2025-03-15 00:40:18,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 3172 transitions, 84097 flow [2025-03-15 00:40:18,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 00:40:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 00:40:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3290 transitions. [2025-03-15 00:40:18,224 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6405763239875389 [2025-03-15 00:40:18,224 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 195 predicate places. [2025-03-15 00:40:18,224 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 3172 transitions, 84097 flow [2025-03-15 00:40:18,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:40:18,225 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:40:18,225 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:40:18,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:40:18,225 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:40:18,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:40:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash -786713456, now seen corresponding path program 10 times [2025-03-15 00:40:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:40:18,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279973319] [2025-03-15 00:40:18,226 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:40:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:40:18,298 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:40:18,299 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:40:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:40:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:40:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279973319] [2025-03-15 00:40:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279973319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:40:19,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:40:19,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:40:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530323014] [2025-03-15 00:40:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:40:19,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:40:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:40:19,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:40:19,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:40:19,287 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:40:19,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 3172 transitions, 84097 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:40:19,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:40:19,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:40:19,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:40:41,612 INFO L124 PetriNetUnfolderBase]: 13015/31178 cut-off events. [2025-03-15 00:40:41,613 INFO L125 PetriNetUnfolderBase]: For 362943/371596 co-relation queries the response was YES. [2025-03-15 00:40:41,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365170 conditions, 31178 events. 13015/31178 cut-off events. For 362943/371596 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 243982 event pairs, 3474 based on Foata normal form. 59/28683 useless extension candidates. Maximal degree in co-relation 360919. Up to 20523 conditions per place. [2025-03-15 00:40:41,906 INFO L140 encePairwiseOnDemand]: 275/321 looper letters, 2458 selfloop transitions, 545 changer transitions 0/3243 dead transitions. [2025-03-15 00:40:41,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 3243 transitions, 91971 flow [2025-03-15 00:40:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 00:40:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 00:40:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3089 transitions. [2025-03-15 00:40:41,908 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6415368639667705 [2025-03-15 00:40:41,908 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 209 predicate places. [2025-03-15 00:40:41,908 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 3243 transitions, 91971 flow [2025-03-15 00:40:41,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:40:41,909 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:40:41,909 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:40:41,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:40:41,909 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:40:41,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:40:41,910 INFO L85 PathProgramCache]: Analyzing trace with hash 195727572, now seen corresponding path program 11 times [2025-03-15 00:40:41,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:40:41,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649402452] [2025-03-15 00:40:41,910 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:40:41,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:40:42,134 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:40:42,134 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:40:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:40:43,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:40:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649402452] [2025-03-15 00:40:43,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649402452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:40:43,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:40:43,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:40:43,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271483301] [2025-03-15 00:40:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:40:43,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:40:43,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:40:43,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:40:43,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:40:43,466 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:40:43,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 3243 transitions, 91971 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:40:43,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:40:43,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:40:43,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:41:07,575 INFO L124 PetriNetUnfolderBase]: 13279/31567 cut-off events. [2025-03-15 00:41:07,575 INFO L125 PetriNetUnfolderBase]: For 417980/427191 co-relation queries the response was YES. [2025-03-15 00:41:07,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396731 conditions, 31567 events. 13279/31567 cut-off events. For 417980/427191 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 247042 event pairs, 3421 based on Foata normal form. 47/29072 useless extension candidates. Maximal degree in co-relation 392225. Up to 20933 conditions per place. [2025-03-15 00:41:07,928 INFO L140 encePairwiseOnDemand]: 275/321 looper letters, 2635 selfloop transitions, 571 changer transitions 0/3446 dead transitions. [2025-03-15 00:41:07,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 3446 transitions, 104293 flow [2025-03-15 00:41:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-15 00:41:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-15 00:41:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3480 transitions. [2025-03-15 00:41:07,930 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6377130291368884 [2025-03-15 00:41:07,931 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 225 predicate places. [2025-03-15 00:41:07,931 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 3446 transitions, 104293 flow [2025-03-15 00:41:07,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:41:07,931 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:41:07,932 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:41:07,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:41:07,932 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:41:07,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:41:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash -463489276, now seen corresponding path program 12 times [2025-03-15 00:41:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:41:07,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345997224] [2025-03-15 00:41:07,934 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:41:07,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:41:07,984 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:41:07,985 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:41:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:41:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:41:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345997224] [2025-03-15 00:41:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345997224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:41:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:41:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:41:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471019351] [2025-03-15 00:41:08,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:41:08,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:41:08,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:41:08,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:41:08,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:41:08,178 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:41:08,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 3446 transitions, 104293 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:41:08,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:41:08,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:41:08,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:41:36,718 INFO L124 PetriNetUnfolderBase]: 15109/35594 cut-off events. [2025-03-15 00:41:36,718 INFO L125 PetriNetUnfolderBase]: For 528256/539003 co-relation queries the response was YES. [2025-03-15 00:41:36,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474776 conditions, 35594 events. 15109/35594 cut-off events. For 528256/539003 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 284819 event pairs, 3600 based on Foata normal form. 59/32845 useless extension candidates. Maximal degree in co-relation 470015. Up to 23411 conditions per place. [2025-03-15 00:41:37,112 INFO L140 encePairwiseOnDemand]: 276/321 looper letters, 3254 selfloop transitions, 491 changer transitions 0/3985 dead transitions. [2025-03-15 00:41:37,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 3985 transitions, 128423 flow [2025-03-15 00:41:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:41:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:41:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4217 transitions. [2025-03-15 00:41:37,115 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6255748405281115 [2025-03-15 00:41:37,116 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 245 predicate places. [2025-03-15 00:41:37,116 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 3985 transitions, 128423 flow [2025-03-15 00:41:37,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:41:37,116 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:41:37,117 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:41:37,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:41:37,117 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:41:37,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:41:37,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1983779180, now seen corresponding path program 1 times [2025-03-15 00:41:37,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:41:37,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902907411] [2025-03-15 00:41:37,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:41:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:41:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:41:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:41:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:41:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902907411] [2025-03-15 00:41:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902907411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:41:38,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:41:38,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:41:38,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955792734] [2025-03-15 00:41:38,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:41:38,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:41:38,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:41:38,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:41:38,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:41:38,439 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 321 [2025-03-15 00:41:38,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 3985 transitions, 128423 flow. Second operand has 11 states, 11 states have (on average 183.1818181818182) internal successors, (2015), 11 states have internal predecessors, (2015), 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:41:38,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:41:38,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 321 [2025-03-15 00:41:38,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:12,497 INFO L124 PetriNetUnfolderBase]: 15076/35491 cut-off events. [2025-03-15 00:42:12,497 INFO L125 PetriNetUnfolderBase]: For 592103/604377 co-relation queries the response was YES. [2025-03-15 00:42:12,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499363 conditions, 35491 events. 15076/35491 cut-off events. For 592103/604377 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 283578 event pairs, 3550 based on Foata normal form. 81/32874 useless extension candidates. Maximal degree in co-relation 494367. Up to 23263 conditions per place. [2025-03-15 00:42:12,919 INFO L140 encePairwiseOnDemand]: 266/321 looper letters, 3312 selfloop transitions, 579 changer transitions 0/4209 dead transitions. [2025-03-15 00:42:12,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 4209 transitions, 143379 flow [2025-03-15 00:42:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 00:42:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 00:42:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4627 transitions. [2025-03-15 00:42:12,922 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6267100094812407 [2025-03-15 00:42:12,923 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 267 predicate places. [2025-03-15 00:42:12,923 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 4209 transitions, 143379 flow [2025-03-15 00:42:12,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 183.1818181818182) internal successors, (2015), 11 states have internal predecessors, (2015), 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:42:12,923 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:12,923 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:42:12,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 00:42:12,924 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:42:12,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash -241867018, now seen corresponding path program 13 times [2025-03-15 00:42:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151901461] [2025-03-15 00:42:12,925 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:42:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:42:14,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:14,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151901461] [2025-03-15 00:42:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151901461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:14,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:14,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:42:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295709365] [2025-03-15 00:42:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:14,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:42:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:14,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:42:14,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:42:14,768 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:42:14,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 4209 transitions, 143379 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:42:14,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:14,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:42:14,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:49,950 INFO L124 PetriNetUnfolderBase]: 15152/35502 cut-off events. [2025-03-15 00:42:49,951 INFO L125 PetriNetUnfolderBase]: For 662095/674790 co-relation queries the response was YES. [2025-03-15 00:42:50,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529634 conditions, 35502 events. 15152/35502 cut-off events. For 662095/674790 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 283194 event pairs, 3495 based on Foata normal form. 60/32900 useless extension candidates. Maximal degree in co-relation 524383. Up to 23339 conditions per place. [2025-03-15 00:42:50,432 INFO L140 encePairwiseOnDemand]: 276/321 looper letters, 3474 selfloop transitions, 566 changer transitions 0/4295 dead transitions. [2025-03-15 00:42:50,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 4295 transitions, 154343 flow [2025-03-15 00:42:50,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:42:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:42:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2862 transitions. [2025-03-15 00:42:50,434 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.636849132176235 [2025-03-15 00:42:50,440 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 280 predicate places. [2025-03-15 00:42:50,440 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 4295 transitions, 154343 flow [2025-03-15 00:42:50,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:42:50,440 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:50,441 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:42:50,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:42:50,441 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:42:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -525785788, now seen corresponding path program 14 times [2025-03-15 00:42:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:50,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4906172] [2025-03-15 00:42:50,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:42:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:50,503 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:42:50,503 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:42:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:42:50,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:50,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4906172] [2025-03-15 00:42:50,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4906172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:50,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:50,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:42:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036031091] [2025-03-15 00:42:50,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:50,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:42:50,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:50,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:42:50,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:42:50,851 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:42:50,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 4295 transitions, 154343 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:42:50,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:50,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:42:50,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:43:32,476 INFO L124 PetriNetUnfolderBase]: 15640/36687 cut-off events. [2025-03-15 00:43:32,476 INFO L125 PetriNetUnfolderBase]: For 768053/782204 co-relation queries the response was YES. [2025-03-15 00:43:32,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574103 conditions, 36687 events. 15640/36687 cut-off events. For 768053/782204 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 294889 event pairs, 3562 based on Foata normal form. 72/33997 useless extension candidates. Maximal degree in co-relation 568597. Up to 24007 conditions per place. [2025-03-15 00:43:32,941 INFO L140 encePairwiseOnDemand]: 276/321 looper letters, 3619 selfloop transitions, 635 changer transitions 0/4509 dead transitions. [2025-03-15 00:43:32,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 4509 transitions, 170745 flow [2025-03-15 00:43:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-15 00:43:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-15 00:43:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3433 transitions. [2025-03-15 00:43:32,943 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6291002382261316 [2025-03-15 00:43:32,944 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 296 predicate places. [2025-03-15 00:43:32,944 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 4509 transitions, 170745 flow [2025-03-15 00:43:32,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:43:32,944 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:43:32,944 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:43:32,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 00:43:32,945 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:43:32,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:43:32,946 INFO L85 PathProgramCache]: Analyzing trace with hash 692700278, now seen corresponding path program 15 times [2025-03-15 00:43:32,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:43:32,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561220011] [2025-03-15 00:43:32,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:43:32,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:43:32,995 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:43:32,996 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:43:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:43:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:43:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561220011] [2025-03-15 00:43:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561220011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:43:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:43:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:43:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515131052] [2025-03-15 00:43:33,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:43:33,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:43:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:43:33,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:43:33,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:43:33,194 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:43:33,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 4509 transitions, 170745 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:43:33,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:43:33,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:43:33,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:44:13,690 INFO L124 PetriNetUnfolderBase]: 15688/36789 cut-off events. [2025-03-15 00:44:13,691 INFO L125 PetriNetUnfolderBase]: For 863088/878475 co-relation queries the response was YES. [2025-03-15 00:44:13,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604104 conditions, 36789 events. 15688/36789 cut-off events. For 863088/878475 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 295664 event pairs, 3556 based on Foata normal form. 64/34141 useless extension candidates. Maximal degree in co-relation 598343. Up to 24001 conditions per place. [2025-03-15 00:44:14,183 INFO L140 encePairwiseOnDemand]: 276/321 looper letters, 3686 selfloop transitions, 629 changer transitions 0/4570 dead transitions. [2025-03-15 00:44:14,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 4570 transitions, 181687 flow [2025-03-15 00:44:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 00:44:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 00:44:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3234 transitions. [2025-03-15 00:44:14,185 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6296728971962616 [2025-03-15 00:44:14,186 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 311 predicate places. [2025-03-15 00:44:14,186 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 4570 transitions, 181687 flow [2025-03-15 00:44:14,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:44:14,186 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:44:14,186 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:44:14,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 00:44:14,187 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:44:14,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:44:14,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1477953654, now seen corresponding path program 16 times [2025-03-15 00:44:14,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:44:14,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634986570] [2025-03-15 00:44:14,188 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:44:14,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:44:14,262 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:44:14,262 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:44:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:44:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:44:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634986570] [2025-03-15 00:44:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634986570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:44:15,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:44:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:44:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566466933] [2025-03-15 00:44:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:44:15,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:44:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:44:15,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:44:15,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:44:15,277 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:44:15,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 4570 transitions, 181687 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:44:15,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:44:15,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:44:15,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:45:00,996 INFO L124 PetriNetUnfolderBase]: 15976/37391 cut-off events. [2025-03-15 00:45:00,997 INFO L125 PetriNetUnfolderBase]: For 972541/988938 co-relation queries the response was YES. [2025-03-15 00:45:01,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643885 conditions, 37391 events. 15976/37391 cut-off events. For 972541/988938 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 300791 event pairs, 3538 based on Foata normal form. 64/34733 useless extension candidates. Maximal degree in co-relation 637869. Up to 24395 conditions per place. [2025-03-15 00:45:01,517 INFO L140 encePairwiseOnDemand]: 276/321 looper letters, 3803 selfloop transitions, 685 changer transitions 0/4743 dead transitions. [2025-03-15 00:45:01,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 4743 transitions, 197765 flow [2025-03-15 00:45:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 00:45:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 00:45:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3627 transitions. [2025-03-15 00:45:01,520 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6277258566978193 [2025-03-15 00:45:01,520 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 328 predicate places. [2025-03-15 00:45:01,520 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 4743 transitions, 197765 flow [2025-03-15 00:45:01,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:45:01,521 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:45:01,521 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:45:01,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 00:45:01,521 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:45:01,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:45:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1906296454, now seen corresponding path program 17 times [2025-03-15 00:45:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:45:01,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397765555] [2025-03-15 00:45:01,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:45:01,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:45:01,876 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:45:01,877 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:45:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:45:02,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:45:02,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397765555] [2025-03-15 00:45:02,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397765555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:45:02,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:45:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:45:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842443735] [2025-03-15 00:45:02,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:45:02,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:45:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:45:02,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:45:02,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:45:02,940 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:45:02,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 4743 transitions, 197765 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:45:02,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:45:02,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:45:02,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:45:54,401 INFO L124 PetriNetUnfolderBase]: 17416/40286 cut-off events. [2025-03-15 00:45:54,402 INFO L125 PetriNetUnfolderBase]: For 1133217/1149990 co-relation queries the response was YES. [2025-03-15 00:45:54,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730600 conditions, 40286 events. 17416/40286 cut-off events. For 1133217/1149990 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 328053 event pairs, 3597 based on Foata normal form. 33/37473 useless extension candidates. Maximal degree in co-relation 724329. Up to 26985 conditions per place. [2025-03-15 00:45:55,022 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 4305 selfloop transitions, 667 changer transitions 0/5227 dead transitions. [2025-03-15 00:45:55,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 5227 transitions, 228389 flow [2025-03-15 00:45:55,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:45:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:45:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2856 transitions. [2025-03-15 00:45:55,024 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6355140186915887 [2025-03-15 00:45:55,024 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 341 predicate places. [2025-03-15 00:45:55,024 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 5227 transitions, 228389 flow [2025-03-15 00:45:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:45:55,025 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:45:55,025 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:45:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 00:45:55,026 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:45:55,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:45:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash 168647606, now seen corresponding path program 2 times [2025-03-15 00:45:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:45:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434763784] [2025-03-15 00:45:55,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:45:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:45:55,078 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:45:55,078 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:45:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:45:55,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:45:55,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434763784] [2025-03-15 00:45:55,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434763784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:45:55,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:45:55,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:45:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741240241] [2025-03-15 00:45:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:45:55,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:45:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:45:55,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:45:55,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:45:55,282 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 321 [2025-03-15 00:45:55,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 5227 transitions, 228389 flow. Second operand has 11 states, 11 states have (on average 183.1818181818182) internal successors, (2015), 11 states have internal predecessors, (2015), 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:45:55,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:45:55,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 321 [2025-03-15 00:45:55,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:46:54,994 INFO L124 PetriNetUnfolderBase]: 17608/40847 cut-off events. [2025-03-15 00:46:54,995 INFO L125 PetriNetUnfolderBase]: For 1246078/1265066 co-relation queries the response was YES. [2025-03-15 00:46:55,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768121 conditions, 40847 events. 17608/40847 cut-off events. For 1246078/1265066 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 334355 event pairs, 3654 based on Foata normal form. 62/38027 useless extension candidates. Maximal degree in co-relation 761615. Up to 29324 conditions per place. [2025-03-15 00:46:55,648 INFO L140 encePairwiseOnDemand]: 268/321 looper letters, 4628 selfloop transitions, 378 changer transitions 0/5350 dead transitions. [2025-03-15 00:46:55,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 5350 transitions, 243563 flow [2025-03-15 00:46:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 00:46:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 00:46:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2813 transitions. [2025-03-15 00:46:55,650 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6259457053849578 [2025-03-15 00:46:55,650 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 354 predicate places. [2025-03-15 00:46:55,650 INFO L471 AbstractCegarLoop]: Abstraction has has 676 places, 5350 transitions, 243563 flow [2025-03-15 00:46:55,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 183.1818181818182) internal successors, (2015), 11 states have internal predecessors, (2015), 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:46:55,650 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:46:55,651 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:46:55,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 00:46:55,651 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:46:55,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:46:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1944715450, now seen corresponding path program 18 times [2025-03-15 00:46:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:46:55,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005969038] [2025-03-15 00:46:55,652 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:46:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:46:55,703 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:46:55,704 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:46:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:46:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:46:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005969038] [2025-03-15 00:46:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005969038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:46:56,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:46:56,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:46:56,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874189615] [2025-03-15 00:46:56,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:46:56,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:46:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:46:56,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:46:56,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:46:56,100 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 321 [2025-03-15 00:46:56,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 5350 transitions, 243563 flow. Second operand has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:46:56,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:46:56,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 321 [2025-03-15 00:46:56,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:48:09,255 INFO L124 PetriNetUnfolderBase]: 19254/44174 cut-off events. [2025-03-15 00:48:09,256 INFO L125 PetriNetUnfolderBase]: For 1452797/1472196 co-relation queries the response was YES. [2025-03-15 00:48:09,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872393 conditions, 44174 events. 19254/44174 cut-off events. For 1452797/1472196 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 366646 event pairs, 3773 based on Foata normal form. 41/41139 useless extension candidates. Maximal degree in co-relation 865632. Up to 32160 conditions per place. [2025-03-15 00:48:09,987 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 4846 selfloop transitions, 759 changer transitions 0/5868 dead transitions. [2025-03-15 00:48:09,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 5868 transitions, 279069 flow [2025-03-15 00:48:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 00:48:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 00:48:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3948 transitions. [2025-03-15 00:48:09,989 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6149532710280374 [2025-03-15 00:48:09,990 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 373 predicate places. [2025-03-15 00:48:09,990 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 5868 transitions, 279069 flow [2025-03-15 00:48:09,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 181.36363636363637) internal successors, (1995), 11 states have internal predecessors, (1995), 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:48:09,990 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:48:09,990 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:48:09,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 00:48:09,990 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:48:09,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:48:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1720543338, now seen corresponding path program 3 times [2025-03-15 00:48:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:48:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259127715] [2025-03-15 00:48:09,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:48:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:48:10,039 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:48:10,040 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:48:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:48:10,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:48:10,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259127715] [2025-03-15 00:48:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259127715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:48:10,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:48:10,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:48:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755385486] [2025-03-15 00:48:10,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:48:10,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:48:10,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:48:10,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:48:10,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:48:10,229 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 321 [2025-03-15 00:48:10,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 5868 transitions, 279069 flow. Second operand has 11 states, 11 states have (on average 183.1818181818182) internal successors, (2015), 11 states have internal predecessors, (2015), 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:48:10,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:48:10,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 321 [2025-03-15 00:48:10,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:49:35,233 INFO L124 PetriNetUnfolderBase]: 19276/44393 cut-off events. [2025-03-15 00:49:35,233 INFO L125 PetriNetUnfolderBase]: For 1564573/1585629 co-relation queries the response was YES. [2025-03-15 00:49:35,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906625 conditions, 44393 events. 19276/44393 cut-off events. For 1564573/1585629 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 369600 event pairs, 3802 based on Foata normal form. 78/41423 useless extension candidates. Maximal degree in co-relation 899629. Up to 32128 conditions per place. [2025-03-15 00:49:35,971 INFO L140 encePairwiseOnDemand]: 268/321 looper letters, 5114 selfloop transitions, 505 changer transitions 0/5971 dead transitions. [2025-03-15 00:49:35,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 5971 transitions, 295125 flow [2025-03-15 00:49:35,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 00:49:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 00:49:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3994 transitions. [2025-03-15 00:49:35,973 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6221183800623052 [2025-03-15 00:49:35,974 INFO L298 CegarLoopForPetriNet]: 322 programPoint places, 392 predicate places. [2025-03-15 00:49:35,974 INFO L471 AbstractCegarLoop]: Abstraction has has 714 places, 5971 transitions, 295125 flow [2025-03-15 00:49:35,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 183.1818181818182) internal successors, (2015), 11 states have internal predecessors, (2015), 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:49:35,975 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:49:35,975 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-03-15 00:49:35,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 00:49:35,975 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:49:35,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:49:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2064786156, now seen corresponding path program 4 times [2025-03-15 00:49:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:49:35,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462109665] [2025-03-15 00:49:35,977 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:49:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:49:36,061 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:49:36,061 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:49:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-15 00:49:37,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:49:37,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462109665] [2025-03-15 00:49:37,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462109665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:49:37,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:49:37,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:49:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65841910] [2025-03-15 00:49:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:49:37,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 00:49:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:49:37,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 00:49:37,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-15 00:49:37,146 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 321 [2025-03-15 00:49:37,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 5971 transitions, 295125 flow. Second operand has 11 states, 11 states have (on average 183.1818181818182) internal successors, (2015), 11 states have internal predecessors, (2015), 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:49:37,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:49:37,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 321 [2025-03-15 00:49:37,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 00:50:42,923 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:50:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 00:50:43,031 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2025-03-15 00:50:43,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 00:50:43,032 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-03-15 00:50:43,034 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-03-15 00:50:43,035 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-03-15 00:50:43,035 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-03-15 00:50:43,035 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-03-15 00:50:43,035 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-03-15 00:50:43,035 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-03-15 00:50:43,035 INFO L422 BasicCegarLoop]: Path program histogram: [18, 4, 2, 2, 1, 1, 1, 1] [2025-03-15 00:50:43,044 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:50:43,044 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:50:43,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:50:43 BasicIcfg [2025-03-15 00:50:43,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:50:43,053 INFO L158 Benchmark]: Toolchain (without parser) took 799448.94ms. Allocated memory was 71.3MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 41.9MB in the beginning and 939.5MB in the end (delta: -897.6MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-03-15 00:50:43,056 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 71.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:50:43,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.00ms. Allocated memory is still 71.3MB. Free memory was 41.7MB in the beginning and 23.8MB in the end (delta: 17.9MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2025-03-15 00:50:43,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.33ms. Allocated memory is still 71.3MB. Free memory was 23.8MB in the beginning and 39.5MB in the end (delta: -15.7MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2025-03-15 00:50:43,056 INFO L158 Benchmark]: Boogie Preprocessor took 51.21ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 35.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:50:43,056 INFO L158 Benchmark]: RCFGBuilder took 592.82ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 35.9MB in the beginning and 47.3MB in the end (delta: -11.4MB). Peak memory consumption was 28.2MB. Max. memory is 8.0GB. [2025-03-15 00:50:43,056 INFO L158 Benchmark]: TraceAbstraction took 798104.74ms. Allocated memory was 96.5MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 46.1MB in the beginning and 939.5MB in the end (delta: -893.4MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-03-15 00:50:43,058 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.22ms. Allocated memory is still 71.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 611.00ms. Allocated memory is still 71.3MB. Free memory was 41.7MB in the beginning and 23.8MB in the end (delta: 17.9MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.33ms. Allocated memory is still 71.3MB. Free memory was 23.8MB in the beginning and 39.5MB in the end (delta: -15.7MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.21ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 35.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 592.82ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 35.9MB in the beginning and 47.3MB in the end (delta: -11.4MB). Peak memory consumption was 28.2MB. Max. memory is 8.0GB. * TraceAbstraction took 798104.74ms. Allocated memory was 96.5MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 46.1MB in the beginning and 939.5MB in the end (delta: -893.4MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1255]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1260]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1257]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 179/321 universal loopers) in iteration 30,while PetriNetUnfolder was constructing finite prefix that currently has 729164 conditions, 33871 events (14972/33870 cut-off events. For 1247872/1264022 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 287326 event pairs, 2164 based on Foata normal form. 65/32222 useless extension candidates. Maximal degree in co-relation 721933. Up to 24582 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 405 locations, 25 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: 798.0s, OverallIterations: 30, TraceHistogramMax: 10, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 775.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5911 SdHoareTripleChecker+Valid, 19.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5911 mSDsluCounter, 15629 SdHoareTripleChecker+Invalid, 15.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10710 mSDsCounter, 1022 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38815 IncrementalHoareTripleChecker+Invalid, 39837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1022 mSolverCounterUnsat, 4919 mSDtfsCounter, 38815 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2089 GetRequests, 1564 SyntacticMatches, 11 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2167 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295125occurred in iteration=29, InterpolantAutomatonStates: 425, 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.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 13516 NumberOfCodeBlocks, 8324 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 14246 ConstructedInterpolants, 0 QuantifiedInterpolants, 22846 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2589 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 36 InterpolantComputations, 27 PerfectInterpolantSequences, 39949/42934 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