/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_15-list_entry_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:29:47,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:29:47,957 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:29:47,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:29:47,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:29:47,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:29:47,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:29:47,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:29:47,984 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:29:47,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:29:47,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:29:47,985 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:29:47,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:29:47,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:29:47,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:29:47,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:29:47,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:29:47,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:29:47,986 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:29:47,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:29:47,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:29:47,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:29:47,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:29:47,986 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:29:47,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:29:47,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:29:47,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:29:47,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:29:47,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:29:47,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:29:47,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:29:47,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:29:47,987 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:29:48,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:29:48,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:29:48,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:29:48,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:29:48,225 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:29:48,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_15-list_entry_nr.i [2025-03-15 00:29:49,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/346ed5a7c/c42ca36a4a354fa9a300efa151876e74/FLAGb9b4688b6 [2025-03-15 00:29:49,684 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:29:49,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_15-list_entry_nr.i [2025-03-15 00:29:49,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/346ed5a7c/c42ca36a4a354fa9a300efa151876e74/FLAGb9b4688b6 [2025-03-15 00:29:49,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/346ed5a7c/c42ca36a4a354fa9a300efa151876e74 [2025-03-15 00:29:49,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:29:49,732 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:29:49,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:29:49,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:29:49,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:29:49,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:29:49" (1/1) ... [2025-03-15 00:29:49,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d09fa31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:49, skipping insertion in model container [2025-03-15 00:29:49,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:29:49" (1/1) ... [2025-03-15 00:29:49,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:29:50,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:29:50,042 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:29:50,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:29:50,119 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:29:50,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50 WrapperNode [2025-03-15 00:29:50,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:29:50,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:29:50,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:29:50,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:29:50,126 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:29:50" (1/1) ... [2025-03-15 00:29:50,154 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:29:50" (1/1) ... [2025-03-15 00:29:50,175 INFO L138 Inliner]: procedures = 186, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 94 [2025-03-15 00:29:50,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:29:50,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:29:50,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:29:50,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:29:50,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:29:50,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:29:50,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:29:50,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:29:50,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (1/1) ... [2025-03-15 00:29:50,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:29:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:29:50,240 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:29:50,243 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:29:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:29:50,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:29:50,262 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:29:50,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:29:50,262 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:29:50,262 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:29:50,262 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:29:50,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:29:50,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:29:50,263 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:29:50,338 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:29:50,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:29:50,525 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:29:50,525 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:29:50,540 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:29:50,540 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:29:50,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:29:50 BoogieIcfgContainer [2025-03-15 00:29:50,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:29:50,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:29:50,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:29:50,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:29:50,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:29:49" (1/3) ... [2025-03-15 00:29:50,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b2a78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:29:50, skipping insertion in model container [2025-03-15 00:29:50,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:29:50" (2/3) ... [2025-03-15 00:29:50,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b2a78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:29:50, skipping insertion in model container [2025-03-15 00:29:50,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:29:50" (3/3) ... [2025-03-15 00:29:50,548 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_15-list_entry_nr.i [2025-03-15 00:29:50,560 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:29:50,562 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_15-list_entry_nr.i that has 2 procedures, 112 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-03-15 00:29:50,562 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:29:50,609 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:29:50,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:29:50,664 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;@6ede7035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:29:50,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-15 00:29:50,684 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:29:50,685 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-15 00:29:50,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:29:50,686 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:50,688 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:29:50,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1145957465, now seen corresponding path program 1 times [2025-03-15 00:29:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708815960] [2025-03-15 00:29:50,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:29:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:29:50,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708815960] [2025-03-15 00:29:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708815960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:50,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:29:50,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402306295] [2025-03-15 00:29:50,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:50,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:29:50,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:50,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:29:50,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:29:50,858 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-03-15 00:29:50,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:50,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:50,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-03-15 00:29:50,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:51,003 INFO L124 PetriNetUnfolderBase]: 30/348 cut-off events. [2025-03-15 00:29:51,003 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:29:51,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 348 events. 30/348 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1385 event pairs, 30 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 383. Up to 79 conditions per place. [2025-03-15 00:29:51,012 INFO L140 encePairwiseOnDemand]: 108/111 looper letters, 18 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-03-15 00:29:51,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 261 flow [2025-03-15 00:29:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:29:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:29:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2025-03-15 00:29:51,025 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8738738738738738 [2025-03-15 00:29:51,027 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 0 predicate places. [2025-03-15 00:29:51,027 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 261 flow [2025-03-15 00:29:51,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:51,028 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:51,028 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:29:51,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:29:51,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:51,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:51,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1477363984, now seen corresponding path program 1 times [2025-03-15 00:29:51,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:51,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768709761] [2025-03-15 00:29:51,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:29:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:51,064 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:29:51,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:51,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768709761] [2025-03-15 00:29:51,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768709761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:51,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:51,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:29:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082111594] [2025-03-15 00:29:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:51,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:29:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:51,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:29:51,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:29:51,066 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 111 [2025-03-15 00:29:51,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:51,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:51,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 111 [2025-03-15 00:29:51,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:51,120 INFO L124 PetriNetUnfolderBase]: 20/295 cut-off events. [2025-03-15 00:29:51,120 INFO L125 PetriNetUnfolderBase]: For 27/37 co-relation queries the response was YES. [2025-03-15 00:29:51,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 295 events. 20/295 cut-off events. For 27/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1068 event pairs, 20 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 353. Up to 56 conditions per place. [2025-03-15 00:29:51,122 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 12 selfloop transitions, 1 changer transitions 0/106 dead transitions. [2025-03-15 00:29:51,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 106 transitions, 275 flow [2025-03-15 00:29:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:29:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:29:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-03-15 00:29:51,124 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8948948948948949 [2025-03-15 00:29:51,124 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, -1 predicate places. [2025-03-15 00:29:51,124 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 275 flow [2025-03-15 00:29:51,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:51,124 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:51,125 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] [2025-03-15 00:29:51,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:29:51,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:51,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash 227862726, now seen corresponding path program 1 times [2025-03-15 00:29:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985169919] [2025-03-15 00:29:51,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:29:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:51,491 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:29:51,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:51,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985169919] [2025-03-15 00:29:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985169919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:51,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:51,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:29:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663769678] [2025-03-15 00:29:51,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:51,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:29:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:51,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:29:51,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:29:51,493 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 111 [2025-03-15 00:29:51,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:51,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:51,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 111 [2025-03-15 00:29:51,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:51,717 INFO L124 PetriNetUnfolderBase]: 212/837 cut-off events. [2025-03-15 00:29:51,718 INFO L125 PetriNetUnfolderBase]: For 226/262 co-relation queries the response was YES. [2025-03-15 00:29:51,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 837 events. 212/837 cut-off events. For 226/262 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4637 event pairs, 212 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 1470. Up to 475 conditions per place. [2025-03-15 00:29:51,721 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 36 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2025-03-15 00:29:51,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 105 transitions, 355 flow [2025-03-15 00:29:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:29:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:29:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-03-15 00:29:51,726 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6846846846846847 [2025-03-15 00:29:51,726 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 3 predicate places. [2025-03-15 00:29:51,727 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 105 transitions, 355 flow [2025-03-15 00:29:51,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:51,727 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:51,727 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] [2025-03-15 00:29:51,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:29:51,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:51,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash 452530334, now seen corresponding path program 1 times [2025-03-15 00:29:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:51,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079637687] [2025-03-15 00:29:51,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:29:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:52,055 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:29:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079637687] [2025-03-15 00:29:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079637687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:29:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97578330] [2025-03-15 00:29:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:52,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:29:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:52,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:29:52,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:29:52,057 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 111 [2025-03-15 00:29:52,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:52,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:52,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 111 [2025-03-15 00:29:52,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:52,361 INFO L124 PetriNetUnfolderBase]: 310/1119 cut-off events. [2025-03-15 00:29:52,361 INFO L125 PetriNetUnfolderBase]: For 513/601 co-relation queries the response was YES. [2025-03-15 00:29:52,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 1119 events. 310/1119 cut-off events. For 513/601 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6695 event pairs, 187 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 2586. Up to 599 conditions per place. [2025-03-15 00:29:52,369 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 79 selfloop transitions, 22 changer transitions 0/167 dead transitions. [2025-03-15 00:29:52,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 167 transitions, 835 flow [2025-03-15 00:29:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:29:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:29:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2025-03-15 00:29:52,371 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7927927927927928 [2025-03-15 00:29:52,372 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 8 predicate places. [2025-03-15 00:29:52,372 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 167 transitions, 835 flow [2025-03-15 00:29:52,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:52,373 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:52,373 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] [2025-03-15 00:29:52,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:29:52,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:52,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:52,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1521815766, now seen corresponding path program 1 times [2025-03-15 00:29:52,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:52,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269462753] [2025-03-15 00:29:52,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:29:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:52,612 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:29:52,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:52,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269462753] [2025-03-15 00:29:52,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269462753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:52,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:52,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:29:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500283493] [2025-03-15 00:29:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:52,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:29:52,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:52,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:29:52,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:29:52,615 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 111 [2025-03-15 00:29:52,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 167 transitions, 835 flow. Second operand has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:52,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:52,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 111 [2025-03-15 00:29:52,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:52,919 INFO L124 PetriNetUnfolderBase]: 411/1357 cut-off events. [2025-03-15 00:29:52,920 INFO L125 PetriNetUnfolderBase]: For 1043/1138 co-relation queries the response was YES. [2025-03-15 00:29:52,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4013 conditions, 1357 events. 411/1357 cut-off events. For 1043/1138 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8398 event pairs, 197 based on Foata normal form. 0/1267 useless extension candidates. Maximal degree in co-relation 3932. Up to 726 conditions per place. [2025-03-15 00:29:52,928 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 112 selfloop transitions, 42 changer transitions 0/221 dead transitions. [2025-03-15 00:29:52,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 221 transitions, 1495 flow [2025-03-15 00:29:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:29:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:29:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2025-03-15 00:29:52,930 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7867867867867868 [2025-03-15 00:29:52,932 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 13 predicate places. [2025-03-15 00:29:52,932 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 221 transitions, 1495 flow [2025-03-15 00:29:52,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:52,932 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:52,932 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:29:52,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:29:52,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:52,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1875655331, now seen corresponding path program 1 times [2025-03-15 00:29:52,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:52,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363852331] [2025-03-15 00:29:52,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:29:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:53,178 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:29:53,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:53,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363852331] [2025-03-15 00:29:53,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363852331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:53,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:53,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:29:53,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444677899] [2025-03-15 00:29:53,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:53,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:29:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:53,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:29:53,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:29:53,179 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 111 [2025-03-15 00:29:53,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 221 transitions, 1495 flow. Second operand has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:53,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:53,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 111 [2025-03-15 00:29:53,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:53,553 INFO L124 PetriNetUnfolderBase]: 522/1616 cut-off events. [2025-03-15 00:29:53,553 INFO L125 PetriNetUnfolderBase]: For 1610/1739 co-relation queries the response was YES. [2025-03-15 00:29:53,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 1616 events. 522/1616 cut-off events. For 1610/1739 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10379 event pairs, 171 based on Foata normal form. 0/1520 useless extension candidates. Maximal degree in co-relation 5743. Up to 886 conditions per place. [2025-03-15 00:29:53,561 INFO L140 encePairwiseOnDemand]: 96/111 looper letters, 156 selfloop transitions, 57 changer transitions 16/294 dead transitions. [2025-03-15 00:29:53,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 294 transitions, 2563 flow [2025-03-15 00:29:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:29:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:29:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2025-03-15 00:29:53,563 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7762762762762763 [2025-03-15 00:29:53,563 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 18 predicate places. [2025-03-15 00:29:53,563 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2563 flow [2025-03-15 00:29:53,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:53,564 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:53,564 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] [2025-03-15 00:29:53,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:29:53,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash 134748965, now seen corresponding path program 1 times [2025-03-15 00:29:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:53,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653222039] [2025-03-15 00:29:53,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:29:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:53,791 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:29:53,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653222039] [2025-03-15 00:29:53,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653222039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:53,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:53,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:29:53,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141091189] [2025-03-15 00:29:53,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:53,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:29:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:53,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:29:53,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:29:53,793 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 111 [2025-03-15 00:29:53,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2563 flow. Second operand has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:53,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:53,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 111 [2025-03-15 00:29:53,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:54,178 INFO L124 PetriNetUnfolderBase]: 660/1950 cut-off events. [2025-03-15 00:29:54,178 INFO L125 PetriNetUnfolderBase]: For 2510/2565 co-relation queries the response was YES. [2025-03-15 00:29:54,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8242 conditions, 1950 events. 660/1950 cut-off events. For 2510/2565 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 12900 event pairs, 163 based on Foata normal form. 0/1845 useless extension candidates. Maximal degree in co-relation 8147. Up to 1071 conditions per place. [2025-03-15 00:29:54,186 INFO L140 encePairwiseOnDemand]: 96/111 looper letters, 201 selfloop transitions, 58 changer transitions 50/375 dead transitions. [2025-03-15 00:29:54,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 375 transitions, 4015 flow [2025-03-15 00:29:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:29:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:29:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2025-03-15 00:29:54,188 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7762762762762763 [2025-03-15 00:29:54,189 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 23 predicate places. [2025-03-15 00:29:54,189 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 375 transitions, 4015 flow [2025-03-15 00:29:54,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:54,189 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:54,189 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] [2025-03-15 00:29:54,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:29:54,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1344254472, now seen corresponding path program 1 times [2025-03-15 00:29:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:54,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838332795] [2025-03-15 00:29:54,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:29:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:54,983 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:29:54,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:54,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838332795] [2025-03-15 00:29:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838332795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:54,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:54,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:29:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298900875] [2025-03-15 00:29:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:54,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:29:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:54,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:29:54,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:29:54,987 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:29:54,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 375 transitions, 4015 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:54,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:54,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:29:54,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:55,859 INFO L124 PetriNetUnfolderBase]: 932/2514 cut-off events. [2025-03-15 00:29:55,859 INFO L125 PetriNetUnfolderBase]: For 5843/5878 co-relation queries the response was YES. [2025-03-15 00:29:55,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12062 conditions, 2514 events. 932/2514 cut-off events. For 5843/5878 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 16733 event pairs, 75 based on Foata normal form. 14/2422 useless extension candidates. Maximal degree in co-relation 11948. Up to 1321 conditions per place. [2025-03-15 00:29:55,872 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 354 selfloop transitions, 23 changer transitions 141/562 dead transitions. [2025-03-15 00:29:55,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 562 transitions, 6977 flow [2025-03-15 00:29:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:29:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:29:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 822 transitions. [2025-03-15 00:29:55,874 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5696465696465697 [2025-03-15 00:29:55,874 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 35 predicate places. [2025-03-15 00:29:55,875 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 562 transitions, 6977 flow [2025-03-15 00:29:55,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:55,875 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:55,876 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] [2025-03-15 00:29:55,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:29:55,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:55,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1797910664, now seen corresponding path program 2 times [2025-03-15 00:29:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902517878] [2025-03-15 00:29:55,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:29:55,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:55,903 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:29:55,903 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:56,403 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:29:56,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902517878] [2025-03-15 00:29:56,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902517878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:56,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:56,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:29:56,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102767343] [2025-03-15 00:29:56,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:56,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:29:56,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:56,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:29:56,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:29:56,405 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:29:56,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 562 transitions, 6977 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:56,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:56,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:29:56,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:57,322 INFO L124 PetriNetUnfolderBase]: 995/2732 cut-off events. [2025-03-15 00:29:57,322 INFO L125 PetriNetUnfolderBase]: For 8200/8299 co-relation queries the response was YES. [2025-03-15 00:29:57,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14996 conditions, 2732 events. 995/2732 cut-off events. For 8200/8299 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 18482 event pairs, 56 based on Foata normal form. 28/2654 useless extension candidates. Maximal degree in co-relation 14863. Up to 1388 conditions per place. [2025-03-15 00:29:57,337 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 394 selfloop transitions, 37 changer transitions 298/773 dead transitions. [2025-03-15 00:29:57,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 773 transitions, 11083 flow [2025-03-15 00:29:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:29:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:29:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 818 transitions. [2025-03-15 00:29:57,340 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5668745668745668 [2025-03-15 00:29:57,340 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 47 predicate places. [2025-03-15 00:29:57,340 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 773 transitions, 11083 flow [2025-03-15 00:29:57,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:57,341 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:57,341 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] [2025-03-15 00:29:57,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:29:57,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:57,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash -266810982, now seen corresponding path program 1 times [2025-03-15 00:29:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:57,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842278226] [2025-03-15 00:29:57,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:29:57,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:57,744 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:29:57,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:57,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842278226] [2025-03-15 00:29:57,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842278226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:57,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:57,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:29:57,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126801730] [2025-03-15 00:29:57,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:57,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:29:57,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:57,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:29:57,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:29:57,746 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:29:57,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 773 transitions, 11083 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:57,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:57,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:29:57,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:58,943 INFO L124 PetriNetUnfolderBase]: 1734/4494 cut-off events. [2025-03-15 00:29:58,944 INFO L125 PetriNetUnfolderBase]: For 16046/16253 co-relation queries the response was YES. [2025-03-15 00:29:58,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28958 conditions, 4494 events. 1734/4494 cut-off events. For 16046/16253 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 34149 event pairs, 107 based on Foata normal form. 56/4354 useless extension candidates. Maximal degree in co-relation 28806. Up to 2460 conditions per place. [2025-03-15 00:29:58,974 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 709 selfloop transitions, 39 changer transitions 453/1245 dead transitions. [2025-03-15 00:29:58,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1245 transitions, 20965 flow [2025-03-15 00:29:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:29:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:29:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 843 transitions. [2025-03-15 00:29:58,977 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5841995841995842 [2025-03-15 00:29:58,977 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 59 predicate places. [2025-03-15 00:29:58,977 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 1245 transitions, 20965 flow [2025-03-15 00:29:58,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:58,977 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:58,978 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] [2025-03-15 00:29:58,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:29:58,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:29:58,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1597262432, now seen corresponding path program 2 times [2025-03-15 00:29:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869073156] [2025-03-15 00:29:58,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:29:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:58,991 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:29:58,993 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:59,316 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:29:59,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869073156] [2025-03-15 00:29:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869073156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:59,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:29:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586978441] [2025-03-15 00:29:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:59,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:29:59,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:59,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:29:59,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:29:59,318 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:29:59,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 1245 transitions, 20965 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:29:59,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:59,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:29:59,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:00,838 INFO L124 PetriNetUnfolderBase]: 1734/4514 cut-off events. [2025-03-15 00:30:00,838 INFO L125 PetriNetUnfolderBase]: For 20050/20293 co-relation queries the response was YES. [2025-03-15 00:30:00,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32491 conditions, 4514 events. 1734/4514 cut-off events. For 20050/20293 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 34413 event pairs, 107 based on Foata normal form. 64/4382 useless extension candidates. Maximal degree in co-relation 32320. Up to 2470 conditions per place. [2025-03-15 00:30:00,863 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 695 selfloop transitions, 40 changer transitions 479/1258 dead transitions. [2025-03-15 00:30:00,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1258 transitions, 23619 flow [2025-03-15 00:30:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 843 transitions. [2025-03-15 00:30:00,866 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5841995841995842 [2025-03-15 00:30:00,866 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 71 predicate places. [2025-03-15 00:30:00,866 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 1258 transitions, 23619 flow [2025-03-15 00:30:00,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:00,866 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:00,867 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] [2025-03-15 00:30:00,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:30:00,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:00,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash -45055222, now seen corresponding path program 3 times [2025-03-15 00:30:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243478201] [2025-03-15 00:30:00,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:30:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:00,879 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:30:00,879 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:01,310 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:30:01,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243478201] [2025-03-15 00:30:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243478201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:01,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:01,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:01,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165957752] [2025-03-15 00:30:01,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:01,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:01,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:01,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:01,312 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:01,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 1258 transitions, 23619 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:01,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:01,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:01,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:02,523 INFO L124 PetriNetUnfolderBase]: 1098/3043 cut-off events. [2025-03-15 00:30:02,524 INFO L125 PetriNetUnfolderBase]: For 17082/17399 co-relation queries the response was YES. [2025-03-15 00:30:02,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23632 conditions, 3043 events. 1098/3043 cut-off events. For 17082/17399 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 21236 event pairs, 56 based on Foata normal form. 86/3023 useless extension candidates. Maximal degree in co-relation 23442. Up to 1573 conditions per place. [2025-03-15 00:30:02,543 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 407 selfloop transitions, 23 changer transitions 409/883 dead transitions. [2025-03-15 00:30:02,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 883 transitions, 17731 flow [2025-03-15 00:30:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 822 transitions. [2025-03-15 00:30:02,546 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5696465696465697 [2025-03-15 00:30:02,546 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 83 predicate places. [2025-03-15 00:30:02,546 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 883 transitions, 17731 flow [2025-03-15 00:30:02,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:02,547 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:02,547 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] [2025-03-15 00:30:02,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:30:02,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:02,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:02,547 INFO L85 PathProgramCache]: Analyzing trace with hash 374100812, now seen corresponding path program 4 times [2025-03-15 00:30:02,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:02,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240119889] [2025-03-15 00:30:02,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:30:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:02,564 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:30:02,564 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:02,987 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:30:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240119889] [2025-03-15 00:30:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240119889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:02,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:02,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 00:30:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936183035] [2025-03-15 00:30:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:02,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:30:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:02,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:30:02,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-15 00:30:02,989 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 111 [2025-03-15 00:30:02,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 883 transitions, 17731 flow. Second operand has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:02,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:02,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 111 [2025-03-15 00:30:02,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:05,122 INFO L124 PetriNetUnfolderBase]: 2468/6317 cut-off events. [2025-03-15 00:30:05,122 INFO L125 PetriNetUnfolderBase]: For 41615/42092 co-relation queries the response was YES. [2025-03-15 00:30:05,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55275 conditions, 6317 events. 2468/6317 cut-off events. For 41615/42092 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 51824 event pairs, 143 based on Foata normal form. 32/6076 useless extension candidates. Maximal degree in co-relation 55074. Up to 3842 conditions per place. [2025-03-15 00:30:05,165 INFO L140 encePairwiseOnDemand]: 86/111 looper letters, 959 selfloop transitions, 173 changer transitions 661/1846 dead transitions. [2025-03-15 00:30:05,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1846 transitions, 42173 flow [2025-03-15 00:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 00:30:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 00:30:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1796 transitions. [2025-03-15 00:30:05,170 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6472072072072073 [2025-03-15 00:30:05,170 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 107 predicate places. [2025-03-15 00:30:05,170 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 1846 transitions, 42173 flow [2025-03-15 00:30:05,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:05,171 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:05,171 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] [2025-03-15 00:30:05,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:30:05,171 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:05,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash 647598342, now seen corresponding path program 3 times [2025-03-15 00:30:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:05,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456988171] [2025-03-15 00:30:05,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:30:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:05,182 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:30:05,183 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:05,551 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:30:05,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:05,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456988171] [2025-03-15 00:30:05,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456988171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:05,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:05,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:05,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119707835] [2025-03-15 00:30:05,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:05,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:05,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:05,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:05,553 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:05,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1846 transitions, 42173 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:05,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:05,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:05,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:07,383 INFO L124 PetriNetUnfolderBase]: 1856/4861 cut-off events. [2025-03-15 00:30:07,383 INFO L125 PetriNetUnfolderBase]: For 38656/39219 co-relation queries the response was YES. [2025-03-15 00:30:07,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45941 conditions, 4861 events. 1856/4861 cut-off events. For 38656/39219 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 37598 event pairs, 105 based on Foata normal form. 61/4726 useless extension candidates. Maximal degree in co-relation 45721. Up to 2802 conditions per place. [2025-03-15 00:30:07,419 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 755 selfloop transitions, 41 changer transitions 583/1423 dead transitions. [2025-03-15 00:30:07,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 1423 transitions, 34845 flow [2025-03-15 00:30:07,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 857 transitions. [2025-03-15 00:30:07,421 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5939015939015939 [2025-03-15 00:30:07,421 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 109 predicate places. [2025-03-15 00:30:07,422 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 1423 transitions, 34845 flow [2025-03-15 00:30:07,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:07,422 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:07,422 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] [2025-03-15 00:30:07,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:30:07,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:07,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:07,423 INFO L85 PathProgramCache]: Analyzing trace with hash -220000814, now seen corresponding path program 5 times [2025-03-15 00:30:07,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:07,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323139044] [2025-03-15 00:30:07,423 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:30:07,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:07,437 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:30:07,438 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:07,893 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:30:07,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:07,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323139044] [2025-03-15 00:30:07,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323139044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:07,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:07,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046009890] [2025-03-15 00:30:07,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:07,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:07,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:07,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:07,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:07,894 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:07,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 1423 transitions, 34845 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:07,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:07,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:07,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:09,978 INFO L124 PetriNetUnfolderBase]: 2497/6424 cut-off events. [2025-03-15 00:30:09,979 INFO L125 PetriNetUnfolderBase]: For 61326/62069 co-relation queries the response was YES. [2025-03-15 00:30:09,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66072 conditions, 6424 events. 2497/6424 cut-off events. For 61326/62069 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 53063 event pairs, 152 based on Foata normal form. 84/6224 useless extension candidates. Maximal degree in co-relation 65833. Up to 3923 conditions per place. [2025-03-15 00:30:10,021 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 1049 selfloop transitions, 42 changer transitions 707/1842 dead transitions. [2025-03-15 00:30:10,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 1842 transitions, 49297 flow [2025-03-15 00:30:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 877 transitions. [2025-03-15 00:30:10,023 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6077616077616078 [2025-03-15 00:30:10,023 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 121 predicate places. [2025-03-15 00:30:10,023 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 1842 transitions, 49297 flow [2025-03-15 00:30:10,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:10,024 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:10,024 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] [2025-03-15 00:30:10,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:30:10,024 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:10,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1080490660, now seen corresponding path program 6 times [2025-03-15 00:30:10,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:10,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388095145] [2025-03-15 00:30:10,024 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:30:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:10,035 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:30:10,036 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:10,246 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:30:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388095145] [2025-03-15 00:30:10,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388095145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:10,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:10,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:10,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013096681] [2025-03-15 00:30:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:10,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:10,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:10,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:10,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:10,248 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:10,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1842 transitions, 49297 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:10,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:10,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:10,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:12,131 INFO L124 PetriNetUnfolderBase]: 1901/5023 cut-off events. [2025-03-15 00:30:12,131 INFO L125 PetriNetUnfolderBase]: For 55776/56635 co-relation queries the response was YES. [2025-03-15 00:30:12,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55153 conditions, 5023 events. 1901/5023 cut-off events. For 55776/56635 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 39318 event pairs, 105 based on Foata normal form. 76/4903 useless extension candidates. Maximal degree in co-relation 54895. Up to 2915 conditions per place. [2025-03-15 00:30:12,159 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 767 selfloop transitions, 26 changer transitions 649/1486 dead transitions. [2025-03-15 00:30:12,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 1486 transitions, 42183 flow [2025-03-15 00:30:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 853 transitions. [2025-03-15 00:30:12,161 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5911295911295912 [2025-03-15 00:30:12,161 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 133 predicate places. [2025-03-15 00:30:12,161 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 1486 transitions, 42183 flow [2025-03-15 00:30:12,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:12,161 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:12,161 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] [2025-03-15 00:30:12,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:30:12,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1602128666, now seen corresponding path program 7 times [2025-03-15 00:30:12,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:12,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726678933] [2025-03-15 00:30:12,162 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:30:12,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:30:12,517 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:30:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:12,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726678933] [2025-03-15 00:30:12,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726678933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:12,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:12,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196943445] [2025-03-15 00:30:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:12,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:12,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:12,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:12,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:12,518 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:12,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 1486 transitions, 42183 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:12,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:12,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:12,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:14,813 INFO L124 PetriNetUnfolderBase]: 2527/6546 cut-off events. [2025-03-15 00:30:14,813 INFO L125 PetriNetUnfolderBase]: For 85510/86526 co-relation queries the response was YES. [2025-03-15 00:30:14,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77303 conditions, 6546 events. 2527/6546 cut-off events. For 85510/86526 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 54462 event pairs, 152 based on Foata normal form. 89/6351 useless extension candidates. Maximal degree in co-relation 77026. Up to 4007 conditions per place. [2025-03-15 00:30:14,853 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 1032 selfloop transitions, 42 changer transitions 770/1888 dead transitions. [2025-03-15 00:30:14,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1888 transitions, 57915 flow [2025-03-15 00:30:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 876 transitions. [2025-03-15 00:30:14,854 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6070686070686071 [2025-03-15 00:30:14,855 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 145 predicate places. [2025-03-15 00:30:14,855 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 1888 transitions, 57915 flow [2025-03-15 00:30:14,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:14,855 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:14,855 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] [2025-03-15 00:30:14,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:30:14,855 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:14,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1296040834, now seen corresponding path program 8 times [2025-03-15 00:30:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:14,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264807249] [2025-03-15 00:30:14,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:30:14,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:14,865 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:30:14,865 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:15,163 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:30:15,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:15,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264807249] [2025-03-15 00:30:15,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264807249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:15,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:15,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:15,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620690446] [2025-03-15 00:30:15,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:15,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:15,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:15,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:15,165 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:15,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 1888 transitions, 57915 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:15,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:15,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:15,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:17,110 INFO L124 PetriNetUnfolderBase]: 1931/5156 cut-off events. [2025-03-15 00:30:17,110 INFO L125 PetriNetUnfolderBase]: For 76372/77362 co-relation queries the response was YES. [2025-03-15 00:30:17,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64424 conditions, 5156 events. 1931/5156 cut-off events. For 76372/77362 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 40720 event pairs, 103 based on Foata normal form. 74/5034 useless extension candidates. Maximal degree in co-relation 64128. Up to 2999 conditions per place. [2025-03-15 00:30:17,149 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 738 selfloop transitions, 40 changer transitions 710/1532 dead transitions. [2025-03-15 00:30:17,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 1532 transitions, 49469 flow [2025-03-15 00:30:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 855 transitions. [2025-03-15 00:30:17,150 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5925155925155925 [2025-03-15 00:30:17,151 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 157 predicate places. [2025-03-15 00:30:17,151 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 1532 transitions, 49469 flow [2025-03-15 00:30:17,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:17,151 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:17,151 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] [2025-03-15 00:30:17,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:30:17,151 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:17,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash 395248182, now seen corresponding path program 9 times [2025-03-15 00:30:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:17,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841536918] [2025-03-15 00:30:17,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:30:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:17,163 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:30:17,164 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:17,467 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:30:17,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:17,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841536918] [2025-03-15 00:30:17,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841536918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:17,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:17,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578512283] [2025-03-15 00:30:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:17,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:17,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:17,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:17,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:17,468 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:17,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1532 transitions, 49469 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:17,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:17,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:17,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:19,320 INFO L124 PetriNetUnfolderBase]: 1916/5154 cut-off events. [2025-03-15 00:30:19,321 INFO L125 PetriNetUnfolderBase]: For 87388/88496 co-relation queries the response was YES. [2025-03-15 00:30:19,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68274 conditions, 5154 events. 1916/5154 cut-off events. For 87388/88496 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 40974 event pairs, 103 based on Foata normal form. 103/5061 useless extension candidates. Maximal degree in co-relation 67959. Up to 2997 conditions per place. [2025-03-15 00:30:19,356 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 716 selfloop transitions, 39 changer transitions 737/1536 dead transitions. [2025-03-15 00:30:19,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 1536 transitions, 52545 flow [2025-03-15 00:30:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 857 transitions. [2025-03-15 00:30:19,358 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5939015939015939 [2025-03-15 00:30:19,358 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 169 predicate places. [2025-03-15 00:30:19,358 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 1536 transitions, 52545 flow [2025-03-15 00:30:19,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:19,359 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:19,359 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] [2025-03-15 00:30:19,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:30:19,359 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:19,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2100911808, now seen corresponding path program 10 times [2025-03-15 00:30:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476886325] [2025-03-15 00:30:19,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:30:19,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:19,379 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:30:19,379 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:19,639 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:30:19,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476886325] [2025-03-15 00:30:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476886325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:19,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 00:30:19,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380564017] [2025-03-15 00:30:19,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:19,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:30:19,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:19,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:30:19,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-15 00:30:19,641 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 111 [2025-03-15 00:30:19,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 1536 transitions, 52545 flow. Second operand has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:19,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:19,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 111 [2025-03-15 00:30:19,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:22,006 INFO L124 PetriNetUnfolderBase]: 2002/5365 cut-off events. [2025-03-15 00:30:22,006 INFO L125 PetriNetUnfolderBase]: For 101190/102206 co-relation queries the response was YES. [2025-03-15 00:30:22,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75315 conditions, 5365 events. 2002/5365 cut-off events. For 101190/102206 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 42933 event pairs, 94 based on Foata normal form. 59/5225 useless extension candidates. Maximal degree in co-relation 74989. Up to 3147 conditions per place. [2025-03-15 00:30:22,051 INFO L140 encePairwiseOnDemand]: 87/111 looper letters, 723 selfloop transitions, 136 changer transitions 755/1667 dead transitions. [2025-03-15 00:30:22,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 1667 transitions, 60385 flow [2025-03-15 00:30:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 00:30:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 00:30:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1450 transitions. [2025-03-15 00:30:22,053 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6531531531531531 [2025-03-15 00:30:22,053 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 188 predicate places. [2025-03-15 00:30:22,053 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 1667 transitions, 60385 flow [2025-03-15 00:30:22,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:22,053 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:22,054 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] [2025-03-15 00:30:22,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:30:22,054 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:22,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash 391008896, now seen corresponding path program 4 times [2025-03-15 00:30:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447114784] [2025-03-15 00:30:22,054 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:30:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:22,064 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:30:22,064 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:22,343 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:30:22,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447114784] [2025-03-15 00:30:22,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447114784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:22,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:22,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:22,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539566801] [2025-03-15 00:30:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:22,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:22,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:22,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:22,345 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:22,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 1667 transitions, 60385 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:22,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:22,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:22,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:23,860 INFO L124 PetriNetUnfolderBase]: 1295/3703 cut-off events. [2025-03-15 00:30:23,860 INFO L125 PetriNetUnfolderBase]: For 78515/79599 co-relation queries the response was YES. [2025-03-15 00:30:23,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54167 conditions, 3703 events. 1295/3703 cut-off events. For 78515/79599 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 27588 event pairs, 56 based on Foata normal form. 76/3673 useless extension candidates. Maximal degree in co-relation 53822. Up to 1945 conditions per place. [2025-03-15 00:30:23,889 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 426 selfloop transitions, 19 changer transitions 665/1154 dead transitions. [2025-03-15 00:30:23,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 1154 transitions, 43187 flow [2025-03-15 00:30:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 803 transitions. [2025-03-15 00:30:23,890 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5564795564795565 [2025-03-15 00:30:23,890 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 193 predicate places. [2025-03-15 00:30:23,890 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 1154 transitions, 43187 flow [2025-03-15 00:30:23,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:23,891 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:23,891 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] [2025-03-15 00:30:23,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 00:30:23,891 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:23,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash 600603580, now seen corresponding path program 11 times [2025-03-15 00:30:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:23,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804161478] [2025-03-15 00:30:23,891 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:30:23,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:23,900 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:30:23,901 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:24,120 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:30:24,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:24,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804161478] [2025-03-15 00:30:24,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804161478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:24,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:24,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:24,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279275320] [2025-03-15 00:30:24,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:24,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:24,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:24,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:24,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:24,121 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:24,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 1154 transitions, 43187 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:24,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:24,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:24,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:25,964 INFO L124 PetriNetUnfolderBase]: 2135/5708 cut-off events. [2025-03-15 00:30:25,964 INFO L125 PetriNetUnfolderBase]: For 134265/135527 co-relation queries the response was YES. [2025-03-15 00:30:25,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88975 conditions, 5708 events. 2135/5708 cut-off events. For 134265/135527 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 45929 event pairs, 106 based on Foata normal form. 45/5558 useless extension candidates. Maximal degree in co-relation 88611. Up to 3258 conditions per place. [2025-03-15 00:30:26,010 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 789 selfloop transitions, 40 changer transitions 854/1727 dead transitions. [2025-03-15 00:30:26,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 1727 transitions, 69117 flow [2025-03-15 00:30:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 859 transitions. [2025-03-15 00:30:26,011 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5952875952875953 [2025-03-15 00:30:26,011 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 205 predicate places. [2025-03-15 00:30:26,011 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 1727 transitions, 69117 flow [2025-03-15 00:30:26,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:26,012 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:26,012 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] [2025-03-15 00:30:26,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:30:26,012 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:26,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1922261580, now seen corresponding path program 12 times [2025-03-15 00:30:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593191372] [2025-03-15 00:30:26,013 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:30:26,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:26,021 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:30:26,022 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:26,288 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:30:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593191372] [2025-03-15 00:30:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593191372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:26,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352970800] [2025-03-15 00:30:26,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:26,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:26,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:26,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:26,289 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:26,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 1727 transitions, 69117 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:26,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:26,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:26,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:29,327 INFO L124 PetriNetUnfolderBase]: 2776/7263 cut-off events. [2025-03-15 00:30:29,327 INFO L125 PetriNetUnfolderBase]: For 193480/195121 co-relation queries the response was YES. [2025-03-15 00:30:29,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119115 conditions, 7263 events. 2776/7263 cut-off events. For 193480/195121 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 61702 event pairs, 153 based on Foata normal form. 84/7064 useless extension candidates. Maximal degree in co-relation 118732. Up to 4379 conditions per place. [2025-03-15 00:30:29,390 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 1083 selfloop transitions, 41 changer transitions 978/2146 dead transitions. [2025-03-15 00:30:29,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 2146 transitions, 90881 flow [2025-03-15 00:30:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 879 transitions. [2025-03-15 00:30:29,391 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6091476091476091 [2025-03-15 00:30:29,392 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 217 predicate places. [2025-03-15 00:30:29,392 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 2146 transitions, 90881 flow [2025-03-15 00:30:29,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:29,392 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:29,392 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] [2025-03-15 00:30:29,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 00:30:29,392 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1512215870, now seen corresponding path program 13 times [2025-03-15 00:30:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380088723] [2025-03-15 00:30:29,393 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:30:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:30:29,677 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:30:29,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:29,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380088723] [2025-03-15 00:30:29,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380088723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:29,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:29,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:29,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060559032] [2025-03-15 00:30:29,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:29,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:29,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:29,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:29,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:29,679 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:29,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 2146 transitions, 90881 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:29,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:29,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:29,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:32,738 INFO L124 PetriNetUnfolderBase]: 2180/5873 cut-off events. [2025-03-15 00:30:32,738 INFO L125 PetriNetUnfolderBase]: For 169763/171316 co-relation queries the response was YES. [2025-03-15 00:30:32,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100610 conditions, 5873 events. 2180/5873 cut-off events. For 169763/171316 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 47805 event pairs, 104 based on Foata normal form. 75/5753 useless extension candidates. Maximal degree in co-relation 100208. Up to 3371 conditions per place. [2025-03-15 00:30:32,793 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 801 selfloop transitions, 25 changer transitions 920/1790 dead transitions. [2025-03-15 00:30:32,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1790 transitions, 78679 flow [2025-03-15 00:30:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 855 transitions. [2025-03-15 00:30:32,794 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5925155925155925 [2025-03-15 00:30:32,795 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 229 predicate places. [2025-03-15 00:30:32,795 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 1790 transitions, 78679 flow [2025-03-15 00:30:32,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:32,795 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:32,795 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] [2025-03-15 00:30:32,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 00:30:32,795 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:32,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1724330464, now seen corresponding path program 14 times [2025-03-15 00:30:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:32,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989290560] [2025-03-15 00:30:32,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:30:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:32,805 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:30:32,805 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:33,084 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:30:33,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:33,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989290560] [2025-03-15 00:30:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989290560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:33,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:33,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079539849] [2025-03-15 00:30:33,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:33,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:33,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:33,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:33,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:33,086 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:33,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 1790 transitions, 78679 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:33,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:33,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:33,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:36,468 INFO L124 PetriNetUnfolderBase]: 2851/7486 cut-off events. [2025-03-15 00:30:36,468 INFO L125 PetriNetUnfolderBase]: For 242819/244661 co-relation queries the response was YES. [2025-03-15 00:30:36,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134327 conditions, 7486 events. 2851/7486 cut-off events. For 242819/244661 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 63963 event pairs, 144 based on Foata normal form. 74/7278 useless extension candidates. Maximal degree in co-relation 133906. Up to 4523 conditions per place. [2025-03-15 00:30:36,532 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 1109 selfloop transitions, 39 changer transitions 1047/2239 dead transitions. [2025-03-15 00:30:36,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 2239 transitions, 103685 flow [2025-03-15 00:30:36,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 875 transitions. [2025-03-15 00:30:36,533 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6063756063756064 [2025-03-15 00:30:36,534 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 241 predicate places. [2025-03-15 00:30:36,534 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 2239 transitions, 103685 flow [2025-03-15 00:30:36,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:36,534 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:36,534 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] [2025-03-15 00:30:36,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 00:30:36,534 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:36,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:36,535 INFO L85 PathProgramCache]: Analyzing trace with hash -74476842, now seen corresponding path program 15 times [2025-03-15 00:30:36,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:36,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208147636] [2025-03-15 00:30:36,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:30:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:36,544 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:30:36,544 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:36,794 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:30:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:36,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208147636] [2025-03-15 00:30:36,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208147636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:36,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:36,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413625080] [2025-03-15 00:30:36,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:36,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:36,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:36,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:36,796 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:36,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 2239 transitions, 103685 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:36,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:36,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:36,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:41,185 INFO L124 PetriNetUnfolderBase]: 2880/7583 cut-off events. [2025-03-15 00:30:41,185 INFO L125 PetriNetUnfolderBase]: For 271102/273391 co-relation queries the response was YES. [2025-03-15 00:30:41,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142101 conditions, 7583 events. 2880/7583 cut-off events. For 271102/273391 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 65097 event pairs, 145 based on Foata normal form. 121/7422 useless extension candidates. Maximal degree in co-relation 141661. Up to 4593 conditions per place. [2025-03-15 00:30:41,255 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 1120 selfloop transitions, 26 changer transitions 1082/2272 dead transitions. [2025-03-15 00:30:41,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 2272 transitions, 109687 flow [2025-03-15 00:30:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 875 transitions. [2025-03-15 00:30:41,256 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6063756063756064 [2025-03-15 00:30:41,257 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 253 predicate places. [2025-03-15 00:30:41,257 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 2272 transitions, 109687 flow [2025-03-15 00:30:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:41,257 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:41,257 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] [2025-03-15 00:30:41,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 00:30:41,257 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:41,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 826315810, now seen corresponding path program 16 times [2025-03-15 00:30:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:41,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754438664] [2025-03-15 00:30:41,258 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:30:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:41,271 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:30:41,272 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:41,527 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:30:41,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:41,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754438664] [2025-03-15 00:30:41,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754438664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:41,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:41,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 00:30:41,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306811967] [2025-03-15 00:30:41,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:41,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:30:41,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:41,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:30:41,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-15 00:30:41,529 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 111 [2025-03-15 00:30:41,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 2272 transitions, 109687 flow. Second operand has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:41,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:41,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 111 [2025-03-15 00:30:41,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:47,225 INFO L124 PetriNetUnfolderBase]: 3467/9004 cut-off events. [2025-03-15 00:30:47,226 INFO L125 PetriNetUnfolderBase]: For 350753/353105 co-relation queries the response was YES. [2025-03-15 00:30:47,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175121 conditions, 9004 events. 3467/9004 cut-off events. For 350753/353105 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 80045 event pairs, 186 based on Foata normal form. 74/8722 useless extension candidates. Maximal degree in co-relation 174670. Up to 5592 conditions per place. [2025-03-15 00:30:47,316 INFO L140 encePairwiseOnDemand]: 86/111 looper letters, 1261 selfloop transitions, 198 changer transitions 1186/2698 dead transitions. [2025-03-15 00:30:47,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 2698 transitions, 136195 flow [2025-03-15 00:30:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-15 00:30:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-15 00:30:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1910 transitions. [2025-03-15 00:30:47,318 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6618156618156619 [2025-03-15 00:30:47,318 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 278 predicate places. [2025-03-15 00:30:47,318 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 2698 transitions, 136195 flow [2025-03-15 00:30:47,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:47,318 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:47,319 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] [2025-03-15 00:30:47,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 00:30:47,319 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:47,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 255804960, now seen corresponding path program 5 times [2025-03-15 00:30:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:47,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842699326] [2025-03-15 00:30:47,319 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:30:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:47,327 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:30:47,327 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:47,616 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:30:47,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842699326] [2025-03-15 00:30:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842699326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:47,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:47,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518118310] [2025-03-15 00:30:47,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:47,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:47,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:47,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:47,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:47,618 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:47,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 2698 transitions, 136195 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:47,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:47,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:47,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:52,486 INFO L124 PetriNetUnfolderBase]: 2880/7605 cut-off events. [2025-03-15 00:30:52,487 INFO L125 PetriNetUnfolderBase]: For 321794/324378 co-relation queries the response was YES. [2025-03-15 00:30:52,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154026 conditions, 7605 events. 2880/7605 cut-off events. For 321794/324378 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 65463 event pairs, 145 based on Foata normal form. 75/7398 useless extension candidates. Maximal degree in co-relation 153556. Up to 4606 conditions per place. [2025-03-15 00:30:52,566 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 1095 selfloop transitions, 38 changer transitions 1108/2285 dead transitions. [2025-03-15 00:30:52,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 2285 transitions, 119267 flow [2025-03-15 00:30:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 890 transitions. [2025-03-15 00:30:52,568 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6167706167706167 [2025-03-15 00:30:52,568 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 280 predicate places. [2025-03-15 00:30:52,568 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 2285 transitions, 119267 flow [2025-03-15 00:30:52,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:52,568 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:52,568 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] [2025-03-15 00:30:52,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 00:30:52,568 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:52,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:52,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1686805656, now seen corresponding path program 17 times [2025-03-15 00:30:52,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:52,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427517386] [2025-03-15 00:30:52,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:30:52,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:52,580 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:30:52,580 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:52,784 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:30:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:52,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427517386] [2025-03-15 00:30:52,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427517386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:52,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:52,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:52,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888827603] [2025-03-15 00:30:52,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:52,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:52,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:52,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:52,785 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:52,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 2285 transitions, 119267 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:52,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:52,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:52,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:56,367 INFO L124 PetriNetUnfolderBase]: 2269/6196 cut-off events. [2025-03-15 00:30:56,367 INFO L125 PetriNetUnfolderBase]: For 283150/285836 co-relation queries the response was YES. [2025-03-15 00:30:56,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130153 conditions, 6196 events. 2269/6196 cut-off events. For 283150/285836 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 51448 event pairs, 96 based on Foata normal form. 92/6094 useless extension candidates. Maximal degree in co-relation 129664. Up to 3583 conditions per place. [2025-03-15 00:30:56,447 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 803 selfloop transitions, 20 changer transitions 1052/1919 dead transitions. [2025-03-15 00:30:56,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 1919 transitions, 103183 flow [2025-03-15 00:30:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 886 transitions. [2025-03-15 00:30:56,448 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.613998613998614 [2025-03-15 00:30:56,449 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 291 predicate places. [2025-03-15 00:30:56,449 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 1919 transitions, 103183 flow [2025-03-15 00:30:56,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:56,449 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:56,449 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] [2025-03-15 00:30:56,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 00:30:56,449 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:56,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:56,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1926707546, now seen corresponding path program 18 times [2025-03-15 00:30:56,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:56,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329783151] [2025-03-15 00:30:56,450 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:30:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:56,459 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:30:56,459 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:30:56,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:56,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329783151] [2025-03-15 00:30:56,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329783151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:56,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:56,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:30:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462486803] [2025-03-15 00:30:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:56,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:30:56,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:56,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:30:56,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:30:56,632 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:30:56,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 1919 transitions, 103183 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:56,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:56,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:30:56,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:59,833 INFO L124 PetriNetUnfolderBase]: 2284/6250 cut-off events. [2025-03-15 00:30:59,833 INFO L125 PetriNetUnfolderBase]: For 306104/308914 co-relation queries the response was YES. [2025-03-15 00:30:59,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136057 conditions, 6250 events. 2284/6250 cut-off events. For 306104/308914 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 52006 event pairs, 104 based on Foata normal form. 113/6168 useless extension candidates. Maximal degree in co-relation 135549. Up to 3610 conditions per place. [2025-03-15 00:30:59,897 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 773 selfloop transitions, 34 changer transitions 1096/1947 dead transitions. [2025-03-15 00:30:59,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 1947 transitions, 108529 flow [2025-03-15 00:30:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:30:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:30:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 843 transitions. [2025-03-15 00:30:59,898 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5841995841995842 [2025-03-15 00:30:59,898 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 303 predicate places. [2025-03-15 00:30:59,898 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 1947 transitions, 108529 flow [2025-03-15 00:30:59,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:30:59,899 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:59,899 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] [2025-03-15 00:30:59,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 00:30:59,899 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:30:59,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash -135545172, now seen corresponding path program 19 times [2025-03-15 00:30:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:59,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272450180] [2025-03-15 00:30:59,900 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:30:59,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:31:00,153 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:31:00,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:00,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272450180] [2025-03-15 00:31:00,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272450180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:00,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:00,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415723382] [2025-03-15 00:31:00,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:00,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:00,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:00,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:00,154 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:00,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 1947 transitions, 108529 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:00,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:00,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:00,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:04,204 INFO L124 PetriNetUnfolderBase]: 2925/7811 cut-off events. [2025-03-15 00:31:04,204 INFO L125 PetriNetUnfolderBase]: For 414225/416751 co-relation queries the response was YES. [2025-03-15 00:31:04,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175964 conditions, 7811 events. 2925/7811 cut-off events. For 414225/416751 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 68019 event pairs, 153 based on Foata normal form. 138/7666 useless extension candidates. Maximal degree in co-relation 175437. Up to 4717 conditions per place. [2025-03-15 00:31:04,441 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 1066 selfloop transitions, 38 changer transitions 1220/2368 dead transitions. [2025-03-15 00:31:04,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 2368 transitions, 137555 flow [2025-03-15 00:31:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 863 transitions. [2025-03-15 00:31:04,443 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5980595980595981 [2025-03-15 00:31:04,443 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 315 predicate places. [2025-03-15 00:31:04,443 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 2368 transitions, 137555 flow [2025-03-15 00:31:04,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:04,443 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:04,443 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] [2025-03-15 00:31:04,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 00:31:04,444 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:04,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:04,444 INFO L85 PathProgramCache]: Analyzing trace with hash 466691288, now seen corresponding path program 20 times [2025-03-15 00:31:04,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:04,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854654349] [2025-03-15 00:31:04,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:31:04,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:04,452 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:31:04,453 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:04,608 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:31:04,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:04,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854654349] [2025-03-15 00:31:04,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854654349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:04,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:04,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:04,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953604108] [2025-03-15 00:31:04,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:04,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:04,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:04,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:04,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:04,609 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:04,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 2368 transitions, 137555 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:04,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:04,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:04,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:08,951 INFO L124 PetriNetUnfolderBase]: 2329/6415 cut-off events. [2025-03-15 00:31:08,952 INFO L125 PetriNetUnfolderBase]: For 362201/364777 co-relation queries the response was YES. [2025-03-15 00:31:08,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149580 conditions, 6415 events. 2329/6415 cut-off events. For 362201/364777 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 53873 event pairs, 104 based on Foata normal form. 123/6343 useless extension candidates. Maximal degree in co-relation 149034. Up to 3709 conditions per place. [2025-03-15 00:31:09,024 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 784 selfloop transitions, 20 changer transitions 1163/2011 dead transitions. [2025-03-15 00:31:09,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 2011 transitions, 120035 flow [2025-03-15 00:31:09,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 839 transitions. [2025-03-15 00:31:09,026 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5814275814275814 [2025-03-15 00:31:09,026 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 327 predicate places. [2025-03-15 00:31:09,026 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 2011 transitions, 120035 flow [2025-03-15 00:31:09,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:09,026 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:09,026 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] [2025-03-15 00:31:09,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 00:31:09,026 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:09,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash -963377334, now seen corresponding path program 21 times [2025-03-15 00:31:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:09,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672791049] [2025-03-15 00:31:09,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:31:09,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:09,040 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:31:09,040 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:09,267 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:31:09,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:09,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672791049] [2025-03-15 00:31:09,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672791049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:09,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:09,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:09,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954267011] [2025-03-15 00:31:09,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:09,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:09,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:09,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:09,268 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:09,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 2011 transitions, 120035 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:09,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:09,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:09,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:13,786 INFO L124 PetriNetUnfolderBase]: 2955/7938 cut-off events. [2025-03-15 00:31:13,787 INFO L125 PetriNetUnfolderBase]: For 487386/490342 co-relation queries the response was YES. [2025-03-15 00:31:13,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191026 conditions, 7938 events. 2955/7938 cut-off events. For 487386/490342 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 69505 event pairs, 155 based on Foata normal form. 119/7774 useless extension candidates. Maximal degree in co-relation 190461. Up to 4801 conditions per place. [2025-03-15 00:31:13,871 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 1048 selfloop transitions, 37 changer transitions 1284/2413 dead transitions. [2025-03-15 00:31:13,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 2413 transitions, 149681 flow [2025-03-15 00:31:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 878 transitions. [2025-03-15 00:31:13,872 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6084546084546084 [2025-03-15 00:31:13,872 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 339 predicate places. [2025-03-15 00:31:13,872 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 2413 transitions, 149681 flow [2025-03-15 00:31:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:13,873 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:13,873 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] [2025-03-15 00:31:13,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 00:31:13,873 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:13,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash -237555908, now seen corresponding path program 22 times [2025-03-15 00:31:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:13,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761712343] [2025-03-15 00:31:13,873 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:31:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:13,883 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:31:13,883 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:14,146 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:31:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761712343] [2025-03-15 00:31:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761712343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:14,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:14,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 00:31:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933683291] [2025-03-15 00:31:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:14,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:31:14,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:14,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:31:14,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-15 00:31:14,148 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 111 [2025-03-15 00:31:14,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 2413 transitions, 149681 flow. Second operand has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:14,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:14,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 111 [2025-03-15 00:31:14,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:20,482 INFO L124 PetriNetUnfolderBase]: 2945/7933 cut-off events. [2025-03-15 00:31:20,482 INFO L125 PetriNetUnfolderBase]: For 517713/520782 co-relation queries the response was YES. [2025-03-15 00:31:20,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196684 conditions, 7933 events. 2945/7933 cut-off events. For 517713/520782 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 69558 event pairs, 146 based on Foata normal form. 77/7741 useless extension candidates. Maximal degree in co-relation 196108. Up to 4778 conditions per place. [2025-03-15 00:31:20,569 INFO L140 encePairwiseOnDemand]: 86/111 looper letters, 950 selfloop transitions, 166 changer transitions 1301/2470 dead transitions. [2025-03-15 00:31:20,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 2470 transitions, 158059 flow [2025-03-15 00:31:20,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 00:31:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 00:31:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1801 transitions. [2025-03-15 00:31:20,571 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.649009009009009 [2025-03-15 00:31:20,571 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 363 predicate places. [2025-03-15 00:31:20,571 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 2470 transitions, 158059 flow [2025-03-15 00:31:20,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:20,571 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:20,572 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] [2025-03-15 00:31:20,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 00:31:20,572 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:20,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash -808066758, now seen corresponding path program 6 times [2025-03-15 00:31:20,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:20,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561263686] [2025-03-15 00:31:20,572 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:31:20,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:20,580 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:31:20,580 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:31:20,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:20,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561263686] [2025-03-15 00:31:20,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561263686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:20,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:20,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:20,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326440463] [2025-03-15 00:31:20,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:20,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:20,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:20,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:20,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:20,832 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:20,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 2470 transitions, 158059 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:20,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:20,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:20,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:25,899 INFO L124 PetriNetUnfolderBase]: 2359/6545 cut-off events. [2025-03-15 00:31:25,899 INFO L125 PetriNetUnfolderBase]: For 453791/456816 co-relation queries the response was YES. [2025-03-15 00:31:25,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167655 conditions, 6545 events. 2359/6545 cut-off events. For 453791/456816 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 55375 event pairs, 106 based on Foata normal form. 87/6437 useless extension candidates. Maximal degree in co-relation 167060. Up to 3793 conditions per place. [2025-03-15 00:31:25,984 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 754 selfloop transitions, 35 changer transitions 1224/2057 dead transitions. [2025-03-15 00:31:25,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 2057 transitions, 134893 flow [2025-03-15 00:31:25,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 857 transitions. [2025-03-15 00:31:25,985 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5939015939015939 [2025-03-15 00:31:25,986 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 365 predicate places. [2025-03-15 00:31:25,986 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 2057 transitions, 134893 flow [2025-03-15 00:31:25,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:25,986 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:25,986 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] [2025-03-15 00:31:25,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 00:31:25,986 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:25,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:25,987 INFO L85 PathProgramCache]: Analyzing trace with hash 376032920, now seen corresponding path program 23 times [2025-03-15 00:31:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400261309] [2025-03-15 00:31:25,987 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:31:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:25,996 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:31:25,996 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:26,161 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:31:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400261309] [2025-03-15 00:31:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400261309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402645222] [2025-03-15 00:31:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:26,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:26,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:26,163 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:26,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 2057 transitions, 134893 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:26,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:26,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:26,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:30,281 INFO L124 PetriNetUnfolderBase]: 2344/6532 cut-off events. [2025-03-15 00:31:30,281 INFO L125 PetriNetUnfolderBase]: For 485426/489020 co-relation queries the response was YES. [2025-03-15 00:31:30,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172576 conditions, 6532 events. 2344/6532 cut-off events. For 485426/489020 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 55536 event pairs, 104 based on Foata normal form. 100/6437 useless extension candidates. Maximal degree in co-relation 171962. Up to 3791 conditions per place. [2025-03-15 00:31:30,346 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 732 selfloop transitions, 34 changer transitions 1251/2061 dead transitions. [2025-03-15 00:31:30,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 2061 transitions, 139155 flow [2025-03-15 00:31:30,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 889 transitions. [2025-03-15 00:31:30,347 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6160776160776161 [2025-03-15 00:31:30,348 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 377 predicate places. [2025-03-15 00:31:30,348 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 2061 transitions, 139155 flow [2025-03-15 00:31:30,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:30,348 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:30,348 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] [2025-03-15 00:31:30,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 00:31:30,348 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:30,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash -608041892, now seen corresponding path program 24 times [2025-03-15 00:31:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:30,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660599296] [2025-03-15 00:31:30,349 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:31:30,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:30,357 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:31:30,357 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:30,509 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:31:30,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:30,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660599296] [2025-03-15 00:31:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660599296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:30,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123383694] [2025-03-15 00:31:30,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:30,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:30,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:30,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:30,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:30,511 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:30,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 2061 transitions, 139155 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:30,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:30,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:30,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:33,811 INFO L124 PetriNetUnfolderBase]: 1698/5026 cut-off events. [2025-03-15 00:31:33,812 INFO L125 PetriNetUnfolderBase]: For 400825/404558 co-relation queries the response was YES. [2025-03-15 00:31:33,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136481 conditions, 5026 events. 1698/5026 cut-off events. For 400825/404558 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 41210 event pairs, 57 based on Foata normal form. 75/4998 useless extension candidates. Maximal degree in co-relation 135848. Up to 2729 conditions per place. [2025-03-15 00:31:33,867 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 432 selfloop transitions, 12 changer transitions 1165/1653 dead transitions. [2025-03-15 00:31:33,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 1653 transitions, 113817 flow [2025-03-15 00:31:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 833 transitions. [2025-03-15 00:31:33,868 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5772695772695773 [2025-03-15 00:31:33,869 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 388 predicate places. [2025-03-15 00:31:33,869 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 1653 transitions, 113817 flow [2025-03-15 00:31:33,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:33,869 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:33,869 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] [2025-03-15 00:31:33,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 00:31:33,869 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:33,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:33,870 INFO L85 PathProgramCache]: Analyzing trace with hash 618962106, now seen corresponding path program 25 times [2025-03-15 00:31:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:33,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954456415] [2025-03-15 00:31:33,870 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:31:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:31:34,123 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:31:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954456415] [2025-03-15 00:31:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954456415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364899427] [2025-03-15 00:31:34,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:34,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:34,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:34,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:34,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:34,125 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:34,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 1653 transitions, 113817 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:34,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:34,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:34,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:37,853 INFO L124 PetriNetUnfolderBase]: 2436/6795 cut-off events. [2025-03-15 00:31:37,854 INFO L125 PetriNetUnfolderBase]: For 576457/580954 co-relation queries the response was YES. [2025-03-15 00:31:37,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190098 conditions, 6795 events. 2436/6795 cut-off events. For 576457/580954 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 58156 event pairs, 105 based on Foata normal form. 102/6704 useless extension candidates. Maximal degree in co-relation 189446. Up to 3863 conditions per place. [2025-03-15 00:31:37,959 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 739 selfloop transitions, 36 changer transitions 1329/2148 dead transitions. [2025-03-15 00:31:37,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 2148 transitions, 153529 flow [2025-03-15 00:31:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 840 transitions. [2025-03-15 00:31:37,961 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5821205821205822 [2025-03-15 00:31:37,962 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 400 predicate places. [2025-03-15 00:31:37,962 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 2148 transitions, 153529 flow [2025-03-15 00:31:37,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:37,962 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:37,962 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:31:37,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-15 00:31:37,962 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:37,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1125479978, now seen corresponding path program 26 times [2025-03-15 00:31:37,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:37,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300741306] [2025-03-15 00:31:37,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:31:37,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:37,972 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:31:37,973 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:38,128 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:31:38,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:38,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300741306] [2025-03-15 00:31:38,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300741306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:38,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:38,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36857858] [2025-03-15 00:31:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:38,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:38,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:38,130 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:38,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 2148 transitions, 153529 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:38,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:38,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:38,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:42,722 INFO L124 PetriNetUnfolderBase]: 2422/6799 cut-off events. [2025-03-15 00:31:42,722 INFO L125 PetriNetUnfolderBase]: For 609628/613749 co-relation queries the response was YES. [2025-03-15 00:31:42,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195275 conditions, 6799 events. 2422/6799 cut-off events. For 609628/613749 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 58396 event pairs, 104 based on Foata normal form. 132/6738 useless extension candidates. Maximal degree in co-relation 194604. Up to 3862 conditions per place. [2025-03-15 00:31:42,804 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 713 selfloop transitions, 39 changer transitions 1356/2152 dead transitions. [2025-03-15 00:31:42,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 2152 transitions, 157997 flow [2025-03-15 00:31:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 842 transitions. [2025-03-15 00:31:42,805 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5835065835065835 [2025-03-15 00:31:42,806 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 412 predicate places. [2025-03-15 00:31:42,806 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 2152 transitions, 157997 flow [2025-03-15 00:31:42,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:42,806 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:42,806 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] [2025-03-15 00:31:42,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-15 00:31:42,806 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:42,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash -877019048, now seen corresponding path program 27 times [2025-03-15 00:31:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:42,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957389186] [2025-03-15 00:31:42,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:31:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:42,815 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:31:42,816 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:42,988 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:31:42,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:42,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957389186] [2025-03-15 00:31:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957389186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:42,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:42,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953215374] [2025-03-15 00:31:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:42,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:42,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:42,989 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:42,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 2152 transitions, 157997 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:42,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:42,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:42,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:47,086 INFO L124 PetriNetUnfolderBase]: 1800/5346 cut-off events. [2025-03-15 00:31:47,086 INFO L125 PetriNetUnfolderBase]: For 505499/509482 co-relation queries the response was YES. [2025-03-15 00:31:47,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157867 conditions, 5346 events. 1800/5346 cut-off events. For 505499/509482 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 44524 event pairs, 56 based on Foata normal form. 111/5354 useless extension candidates. Maximal degree in co-relation 157177. Up to 2853 conditions per place. [2025-03-15 00:31:47,164 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 423 selfloop transitions, 20 changer transitions 1282/1769 dead transitions. [2025-03-15 00:31:47,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 1769 transitions, 132329 flow [2025-03-15 00:31:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 816 transitions. [2025-03-15 00:31:47,165 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5654885654885655 [2025-03-15 00:31:47,166 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 424 predicate places. [2025-03-15 00:31:47,166 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 1769 transitions, 132329 flow [2025-03-15 00:31:47,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:47,166 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:47,166 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] [2025-03-15 00:31:47,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-15 00:31:47,166 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:47,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:47,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1990184536, now seen corresponding path program 28 times [2025-03-15 00:31:47,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:47,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619635660] [2025-03-15 00:31:47,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:31:47,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:47,178 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:31:47,178 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:47,527 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:31:47,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:47,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619635660] [2025-03-15 00:31:47,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619635660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:47,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:47,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:47,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510573305] [2025-03-15 00:31:47,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:47,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:47,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:47,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:47,529 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:47,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 1769 transitions, 132329 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:47,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:47,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:47,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:52,100 INFO L124 PetriNetUnfolderBase]: 2559/7163 cut-off events. [2025-03-15 00:31:52,101 INFO L125 PetriNetUnfolderBase]: For 717851/722776 co-relation queries the response was YES. [2025-03-15 00:31:52,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217317 conditions, 7163 events. 2559/7163 cut-off events. For 717851/722776 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 62079 event pairs, 104 based on Foata normal form. 65/7035 useless extension candidates. Maximal degree in co-relation 216608. Up to 4019 conditions per place. [2025-03-15 00:31:52,206 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 758 selfloop transitions, 35 changer transitions 1450/2287 dead transitions. [2025-03-15 00:31:52,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 2287 transitions, 177017 flow [2025-03-15 00:31:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:31:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:31:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 855 transitions. [2025-03-15 00:31:52,208 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5925155925155925 [2025-03-15 00:31:52,208 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 436 predicate places. [2025-03-15 00:31:52,208 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 2287 transitions, 177017 flow [2025-03-15 00:31:52,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:52,209 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:52,209 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] [2025-03-15 00:31:52,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-15 00:31:52,209 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:31:52,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash 494203382, now seen corresponding path program 29 times [2025-03-15 00:31:52,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:52,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462870303] [2025-03-15 00:31:52,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:31:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:52,221 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:31:52,221 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:52,399 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:31:52,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:52,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462870303] [2025-03-15 00:31:52,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462870303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:52,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:52,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:31:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982085964] [2025-03-15 00:31:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:52,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:31:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:52,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:31:52,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:31:52,401 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:31:52,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 2287 transitions, 177017 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:31:52,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:52,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:31:52,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:00,195 INFO L124 PetriNetUnfolderBase]: 3214/8739 cut-off events. [2025-03-15 00:32:00,195 INFO L125 PetriNetUnfolderBase]: For 927603/932724 co-relation queries the response was YES. [2025-03-15 00:32:00,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271386 conditions, 8739 events. 3214/8739 cut-off events. For 927603/932724 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 78219 event pairs, 154 based on Foata normal form. 75/8533 useless extension candidates. Maximal degree in co-relation 270658. Up to 5140 conditions per place. [2025-03-15 00:32:00,325 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 1062 selfloop transitions, 37 changer transitions 1574/2717 dead transitions. [2025-03-15 00:32:00,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 2717 transitions, 216759 flow [2025-03-15 00:32:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:32:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:32:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 873 transitions. [2025-03-15 00:32:00,326 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.604989604989605 [2025-03-15 00:32:00,326 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 448 predicate places. [2025-03-15 00:32:00,326 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 2717 transitions, 216759 flow [2025-03-15 00:32:00,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:00,326 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:00,327 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] [2025-03-15 00:32:00,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-15 00:32:00,327 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:32:00,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1478278194, now seen corresponding path program 30 times [2025-03-15 00:32:00,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:00,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728411633] [2025-03-15 00:32:00,327 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:32:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:00,337 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:32:00,337 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:32:00,485 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:32:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728411633] [2025-03-15 00:32:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728411633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:00,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:32:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216154148] [2025-03-15 00:32:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:00,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:32:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:00,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:32:00,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:32:00,487 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:32:00,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 2717 transitions, 216759 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:00,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:00,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:32:00,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:08,001 INFO L124 PetriNetUnfolderBase]: 2603/7322 cut-off events. [2025-03-15 00:32:08,001 INFO L125 PetriNetUnfolderBase]: For 818196/823641 co-relation queries the response was YES. [2025-03-15 00:32:08,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233669 conditions, 7322 events. 2603/7322 cut-off events. For 818196/823641 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 63926 event pairs, 105 based on Foata normal form. 104/7233 useless extension candidates. Maximal degree in co-relation 232922. Up to 4117 conditions per place. [2025-03-15 00:32:08,106 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 769 selfloop transitions, 21 changer transitions 1517/2351 dead transitions. [2025-03-15 00:32:08,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 2351 transitions, 191291 flow [2025-03-15 00:32:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:32:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:32:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 854 transitions. [2025-03-15 00:32:08,107 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5918225918225918 [2025-03-15 00:32:08,108 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 460 predicate places. [2025-03-15 00:32:08,108 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 2351 transitions, 191291 flow [2025-03-15 00:32:08,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:08,108 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:08,108 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] [2025-03-15 00:32:08,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-15 00:32:08,108 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:32:08,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash -210043814, now seen corresponding path program 31 times [2025-03-15 00:32:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:08,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354070155] [2025-03-15 00:32:08,109 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:32:08,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:32:08,370 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:32:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354070155] [2025-03-15 00:32:08,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354070155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:08,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:08,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:32:08,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710323121] [2025-03-15 00:32:08,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:08,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:32:08,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:08,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:32:08,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:32:08,371 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:32:08,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 2351 transitions, 191291 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:08,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:08,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:32:08,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:15,163 INFO L124 PetriNetUnfolderBase]: 2603/7342 cut-off events. [2025-03-15 00:32:15,163 INFO L125 PetriNetUnfolderBase]: For 861392/866995 co-relation queries the response was YES. [2025-03-15 00:32:15,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239904 conditions, 7342 events. 2603/7342 cut-off events. For 861392/866995 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 64231 event pairs, 103 based on Foata normal form. 99/7248 useless extension candidates. Maximal degree in co-relation 239138. Up to 4130 conditions per place. [2025-03-15 00:32:15,275 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 740 selfloop transitions, 37 changer transitions 1543/2364 dead transitions. [2025-03-15 00:32:15,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 2364 transitions, 197015 flow [2025-03-15 00:32:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:32:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:32:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 838 transitions. [2025-03-15 00:32:15,277 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5807345807345807 [2025-03-15 00:32:15,277 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 472 predicate places. [2025-03-15 00:32:15,277 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 2364 transitions, 197015 flow [2025-03-15 00:32:15,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:15,278 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:15,278 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] [2025-03-15 00:32:15,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-15 00:32:15,278 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:32:15,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:15,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2132436086, now seen corresponding path program 32 times [2025-03-15 00:32:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:15,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370891409] [2025-03-15 00:32:15,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:32:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:15,289 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:32:15,289 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:32:15,529 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:32:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370891409] [2025-03-15 00:32:15,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370891409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:15,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:15,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:32:15,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736025357] [2025-03-15 00:32:15,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:15,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:32:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:15,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:32:15,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:32:15,531 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:32:15,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 2364 transitions, 197015 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:15,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:15,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:32:15,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:22,724 INFO L124 PetriNetUnfolderBase]: 2633/7450 cut-off events. [2025-03-15 00:32:22,724 INFO L125 PetriNetUnfolderBase]: For 921655/927418 co-relation queries the response was YES. [2025-03-15 00:32:22,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249301 conditions, 7450 events. 2633/7450 cut-off events. For 921655/927418 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 65401 event pairs, 105 based on Foata normal form. 120/7377 useless extension candidates. Maximal degree in co-relation 248516. Up to 4201 conditions per place. [2025-03-15 00:32:22,831 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 752 selfloop transitions, 23 changer transitions 1578/2397 dead transitions. [2025-03-15 00:32:22,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 2397 transitions, 204521 flow [2025-03-15 00:32:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:32:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:32:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 838 transitions. [2025-03-15 00:32:22,833 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5807345807345807 [2025-03-15 00:32:22,834 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 484 predicate places. [2025-03-15 00:32:22,834 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 2397 transitions, 204521 flow [2025-03-15 00:32:22,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:22,835 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:22,835 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] [2025-03-15 00:32:22,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-15 00:32:22,835 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:32:22,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash 439509910, now seen corresponding path program 33 times [2025-03-15 00:32:22,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:22,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036318397] [2025-03-15 00:32:22,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:32:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:22,844 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:32:22,844 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:32:22,993 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:32:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:22,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036318397] [2025-03-15 00:32:22,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036318397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:22,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:22,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:32:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775356829] [2025-03-15 00:32:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:22,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:32:22,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:22,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:32:22,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:32:22,994 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:32:22,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 2397 transitions, 204521 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:22,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:22,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:32:22,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:30,320 INFO L124 PetriNetUnfolderBase]: 2619/7457 cut-off events. [2025-03-15 00:32:30,320 INFO L125 PetriNetUnfolderBase]: For 969026/974979 co-relation queries the response was YES. [2025-03-15 00:32:30,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254999 conditions, 7457 events. 2619/7457 cut-off events. For 969026/974979 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 65776 event pairs, 104 based on Foata normal form. 112/7376 useless extension candidates. Maximal degree in co-relation 254195. Up to 4200 conditions per place. [2025-03-15 00:32:30,418 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 717 selfloop transitions, 35 changer transitions 1605/2401 dead transitions. [2025-03-15 00:32:30,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 2401 transitions, 209543 flow [2025-03-15 00:32:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:32:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:32:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 870 transitions. [2025-03-15 00:32:30,419 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6029106029106029 [2025-03-15 00:32:30,419 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 496 predicate places. [2025-03-15 00:32:30,419 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 2401 transitions, 209543 flow [2025-03-15 00:32:30,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:30,420 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:30,420 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] [2025-03-15 00:32:30,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-15 00:32:30,420 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:32:30,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash -544564902, now seen corresponding path program 34 times [2025-03-15 00:32:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394624394] [2025-03-15 00:32:30,420 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:32:30,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:30,429 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:32:30,429 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:32:30,653 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:32:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394624394] [2025-03-15 00:32:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394624394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:30,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 00:32:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803613052] [2025-03-15 00:32:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:30,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:32:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:30,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:32:30,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-15 00:32:30,654 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 111 [2025-03-15 00:32:30,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 2401 transitions, 209543 flow. Second operand has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:30,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:30,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 111 [2025-03-15 00:32:30,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:39,034 INFO L124 PetriNetUnfolderBase]: 2702/7652 cut-off events. [2025-03-15 00:32:39,034 INFO L125 PetriNetUnfolderBase]: For 1038199/1044576 co-relation queries the response was YES. [2025-03-15 00:32:39,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268156 conditions, 7652 events. 2702/7652 cut-off events. For 1038199/1044576 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 67663 event pairs, 94 based on Foata normal form. 62/7518 useless extension candidates. Maximal degree in co-relation 267341. Up to 4349 conditions per place. [2025-03-15 00:32:39,139 INFO L140 encePairwiseOnDemand]: 87/111 looper letters, 724 selfloop transitions, 132 changer transitions 1621/2530 dead transitions. [2025-03-15 00:32:39,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 2530 transitions, 226009 flow [2025-03-15 00:32:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 00:32:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 00:32:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1466 transitions. [2025-03-15 00:32:39,141 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6603603603603604 [2025-03-15 00:32:39,141 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 515 predicate places. [2025-03-15 00:32:39,141 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 2530 transitions, 226009 flow [2025-03-15 00:32:39,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:39,141 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:39,142 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] [2025-03-15 00:32:39,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-15 00:32:39,142 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:32:39,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:39,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1115075752, now seen corresponding path program 7 times [2025-03-15 00:32:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:39,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192236082] [2025-03-15 00:32:39,142 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:32:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:32:39,308 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:32:39,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:39,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192236082] [2025-03-15 00:32:39,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192236082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:39,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:39,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:32:39,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646990947] [2025-03-15 00:32:39,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:39,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:32:39,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:39,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:32:39,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:32:39,310 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:32:39,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 2530 transitions, 226009 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:39,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:39,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:32:39,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:45,990 INFO L124 PetriNetUnfolderBase]: 1998/6010 cut-off events. [2025-03-15 00:32:45,991 INFO L125 PetriNetUnfolderBase]: For 859509/865678 co-relation queries the response was YES. [2025-03-15 00:32:46,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215139 conditions, 6010 events. 1998/6010 cut-off events. For 859509/865678 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 51702 event pairs, 57 based on Foata normal form. 77/5984 useless extension candidates. Maximal degree in co-relation 214305. Up to 3192 conditions per place. [2025-03-15 00:32:46,072 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 427 selfloop transitions, 15 changer transitions 1532/2018 dead transitions. [2025-03-15 00:32:46,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 2018 transitions, 182933 flow [2025-03-15 00:32:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:32:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:32:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 816 transitions. [2025-03-15 00:32:46,073 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5654885654885655 [2025-03-15 00:32:46,073 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 521 predicate places. [2025-03-15 00:32:46,073 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 2018 transitions, 182933 flow [2025-03-15 00:32:46,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:46,074 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:46,074 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] [2025-03-15 00:32:46,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-15 00:32:46,074 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:32:46,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash -99843270, now seen corresponding path program 35 times [2025-03-15 00:32:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828092730] [2025-03-15 00:32:46,075 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:32:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:46,085 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:32:46,085 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:32:46,245 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:32:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828092730] [2025-03-15 00:32:46,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828092730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:46,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:46,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:32:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258562008] [2025-03-15 00:32:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:46,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:32:46,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:46,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:32:46,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:32:46,246 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:32:46,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 2018 transitions, 182933 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:46,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:46,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:32:46,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:51,759 INFO L124 PetriNetUnfolderBase]: 2011/6048 cut-off events. [2025-03-15 00:32:51,759 INFO L125 PetriNetUnfolderBase]: For 900769/907519 co-relation queries the response was YES. [2025-03-15 00:32:51,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221596 conditions, 6048 events. 2011/6048 cut-off events. For 900769/907519 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 52164 event pairs, 63 based on Foata normal form. 40/5984 useless extension candidates. Maximal degree in co-relation 220743. Up to 3217 conditions per place. [2025-03-15 00:32:51,840 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 393 selfloop transitions, 33 changer transitions 1576/2046 dead transitions. [2025-03-15 00:32:51,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 2046 transitions, 189541 flow [2025-03-15 00:32:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:32:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:32:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 856 transitions. [2025-03-15 00:32:51,842 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5932085932085932 [2025-03-15 00:32:51,842 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 533 predicate places. [2025-03-15 00:32:51,842 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 2046 transitions, 189541 flow [2025-03-15 00:32:51,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:51,843 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:51,843 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] [2025-03-15 00:32:51,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-15 00:32:51,843 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:32:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 900335566, now seen corresponding path program 36 times [2025-03-15 00:32:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192070476] [2025-03-15 00:32:51,844 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:32:51,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:51,853 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:32:51,853 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:32:51,994 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:32:51,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:51,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192070476] [2025-03-15 00:32:51,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192070476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:51,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:51,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:32:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278450718] [2025-03-15 00:32:51,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:51,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:32:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:51,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:32:51,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:32:51,996 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:32:51,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 2046 transitions, 189541 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:51,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:51,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:32:51,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:58,871 INFO L124 PetriNetUnfolderBase]: 2652/7610 cut-off events. [2025-03-15 00:32:58,871 INFO L125 PetriNetUnfolderBase]: For 1191889/1198901 co-relation queries the response was YES. [2025-03-15 00:32:58,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283560 conditions, 7610 events. 2652/7610 cut-off events. For 1191889/1198901 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 67684 event pairs, 112 based on Foata normal form. 63/7481 useless extension candidates. Maximal degree in co-relation 282688. Up to 4324 conditions per place. [2025-03-15 00:32:58,992 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 686 selfloop transitions, 37 changer transitions 1700/2467 dead transitions. [2025-03-15 00:32:58,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 2467 transitions, 234763 flow [2025-03-15 00:32:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:32:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:32:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 876 transitions. [2025-03-15 00:32:58,994 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6070686070686071 [2025-03-15 00:32:58,994 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 545 predicate places. [2025-03-15 00:32:58,994 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 2467 transitions, 234763 flow [2025-03-15 00:32:58,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:58,994 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:58,995 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] [2025-03-15 00:32:58,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-15 00:32:58,995 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:32:58,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1595824424, now seen corresponding path program 37 times [2025-03-15 00:32:58,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:58,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975495529] [2025-03-15 00:32:58,995 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:32:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:32:59,349 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:32:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:59,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975495529] [2025-03-15 00:32:59,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975495529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:59,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:59,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:32:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927443317] [2025-03-15 00:32:59,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:59,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:32:59,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:59,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:32:59,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:32:59,351 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:32:59,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 2467 transitions, 234763 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:32:59,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:59,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:32:59,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:06,172 INFO L124 PetriNetUnfolderBase]: 2056/6208 cut-off events. [2025-03-15 00:33:06,173 INFO L125 PetriNetUnfolderBase]: For 1010576/1017982 co-relation queries the response was YES. [2025-03-15 00:33:06,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237366 conditions, 6208 events. 2056/6208 cut-off events. For 1010576/1017982 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 53944 event pairs, 65 based on Foata normal form. 50/6154 useless extension candidates. Maximal degree in co-relation 236475. Up to 3316 conditions per place. [2025-03-15 00:33:06,254 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 404 selfloop transitions, 19 changer transitions 1643/2110 dead transitions. [2025-03-15 00:33:06,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 2110 transitions, 203875 flow [2025-03-15 00:33:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:33:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:33:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 852 transitions. [2025-03-15 00:33:06,255 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5904365904365905 [2025-03-15 00:33:06,255 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 557 predicate places. [2025-03-15 00:33:06,255 INFO L471 AbstractCegarLoop]: Abstraction has has 672 places, 2110 transitions, 203875 flow [2025-03-15 00:33:06,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:06,255 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:06,256 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:33:06,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-15 00:33:06,256 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:33:06,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash 762359934, now seen corresponding path program 38 times [2025-03-15 00:33:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978300146] [2025-03-15 00:33:06,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:33:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:06,265 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:33:06,265 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:06,508 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:33:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:33:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978300146] [2025-03-15 00:33:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978300146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:33:06,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:33:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:33:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172637228] [2025-03-15 00:33:06,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:33:06,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:33:06,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:33:06,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:33:06,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:33:06,509 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:33:06,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 2110 transitions, 203875 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:06,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:33:06,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:33:06,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:13,635 INFO L124 PetriNetUnfolderBase]: 2728/7822 cut-off events. [2025-03-15 00:33:13,636 INFO L125 PetriNetUnfolderBase]: For 1335063/1343205 co-relation queries the response was YES. [2025-03-15 00:33:13,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304167 conditions, 7822 events. 2728/7822 cut-off events. For 1335063/1343205 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 69967 event pairs, 103 based on Foata normal form. 60/7688 useless extension candidates. Maximal degree in co-relation 303257. Up to 4468 conditions per place. [2025-03-15 00:33:13,743 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 710 selfloop transitions, 36 changer transitions 1769/2559 dead transitions. [2025-03-15 00:33:13,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 2559 transitions, 253767 flow [2025-03-15 00:33:13,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:33:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:33:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 872 transitions. [2025-03-15 00:33:13,745 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6042966042966043 [2025-03-15 00:33:13,745 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 569 predicate places. [2025-03-15 00:33:13,745 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 2559 transitions, 253767 flow [2025-03-15 00:33:13,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:13,745 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:13,745 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] [2025-03-15 00:33:13,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-15 00:33:13,745 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:33:13,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1660374588, now seen corresponding path program 39 times [2025-03-15 00:33:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:13,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384676949] [2025-03-15 00:33:13,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:33:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:13,754 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:33:13,754 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:14,060 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:33:14,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:33:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384676949] [2025-03-15 00:33:14,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384676949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:33:14,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:33:14,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:33:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474466323] [2025-03-15 00:33:14,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:33:14,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:33:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:33:14,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:33:14,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:33:14,061 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:33:14,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 2559 transitions, 253767 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:14,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:33:14,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:33:14,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:23,277 INFO L124 PetriNetUnfolderBase]: 2728/7831 cut-off events. [2025-03-15 00:33:23,277 INFO L125 PetriNetUnfolderBase]: For 1393786/1402655 co-relation queries the response was YES. [2025-03-15 00:33:23,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310888 conditions, 7831 events. 2728/7831 cut-off events. For 1393786/1402655 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 70068 event pairs, 105 based on Foata normal form. 68/7705 useless extension candidates. Maximal degree in co-relation 309959. Up to 4481 conditions per place. [2025-03-15 00:33:23,391 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 699 selfloop transitions, 33 changer transitions 1796/2572 dead transitions. [2025-03-15 00:33:23,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 2572 transitions, 260141 flow [2025-03-15 00:33:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:33:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:33:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 887 transitions. [2025-03-15 00:33:23,392 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6146916146916147 [2025-03-15 00:33:23,392 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 581 predicate places. [2025-03-15 00:33:23,393 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 2572 transitions, 260141 flow [2025-03-15 00:33:23,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:23,393 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:23,393 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] [2025-03-15 00:33:23,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-15 00:33:23,393 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:33:23,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:23,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1411913658, now seen corresponding path program 40 times [2025-03-15 00:33:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:23,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960139286] [2025-03-15 00:33:23,394 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:33:23,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:23,403 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:33:23,403 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:23,624 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:33:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:33:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960139286] [2025-03-15 00:33:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960139286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:33:23,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:33:23,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 00:33:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85067308] [2025-03-15 00:33:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:33:23,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:33:23,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:33:23,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:33:23,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-15 00:33:23,626 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 111 [2025-03-15 00:33:23,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 2572 transitions, 260141 flow. Second operand has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:23,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:33:23,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 111 [2025-03-15 00:33:23,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:36,974 INFO L124 PetriNetUnfolderBase]: 3455/9559 cut-off events. [2025-03-15 00:33:36,975 INFO L125 PetriNetUnfolderBase]: For 1770156/1779707 co-relation queries the response was YES. [2025-03-15 00:33:37,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386280 conditions, 9559 events. 3455/9559 cut-off events. For 1770156/1779707 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 88028 event pairs, 144 based on Foata normal form. 46/9320 useless extension candidates. Maximal degree in co-relation 385340. Up to 5725 conditions per place. [2025-03-15 00:33:37,337 INFO L140 encePairwiseOnDemand]: 86/111 looper letters, 975 selfloop transitions, 166 changer transitions 1907/3101 dead transitions. [2025-03-15 00:33:37,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 3101 transitions, 321187 flow [2025-03-15 00:33:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:33:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:33:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1602 transitions. [2025-03-15 00:33:37,339 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6872586872586872 [2025-03-15 00:33:37,339 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 601 predicate places. [2025-03-15 00:33:37,339 INFO L471 AbstractCegarLoop]: Abstraction has has 716 places, 3101 transitions, 321187 flow [2025-03-15 00:33:37,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:37,339 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:37,339 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] [2025-03-15 00:33:37,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-15 00:33:37,339 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:33:37,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash -708943568, now seen corresponding path program 8 times [2025-03-15 00:33:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:37,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597428997] [2025-03-15 00:33:37,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:33:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:37,350 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:33:37,350 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:37,576 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:33:37,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:33:37,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597428997] [2025-03-15 00:33:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597428997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:33:37,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:33:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:33:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114985258] [2025-03-15 00:33:37,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:33:37,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:33:37,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:33:37,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:33:37,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:33:37,578 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:33:37,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 3101 transitions, 321187 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:37,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:33:37,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:33:37,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:50,065 INFO L124 PetriNetUnfolderBase]: 2758/7953 cut-off events. [2025-03-15 00:33:50,065 INFO L125 PetriNetUnfolderBase]: For 1538390/1547490 co-relation queries the response was YES. [2025-03-15 00:33:50,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327564 conditions, 7953 events. 2758/7953 cut-off events. For 1538390/1547490 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 71604 event pairs, 103 based on Foata normal form. 78/7837 useless extension candidates. Maximal degree in co-relation 326605. Up to 4552 conditions per place. [2025-03-15 00:33:50,184 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 710 selfloop transitions, 20 changer transitions 1831/2605 dead transitions. [2025-03-15 00:33:50,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 2605 transitions, 273753 flow [2025-03-15 00:33:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:33:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:33:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 887 transitions. [2025-03-15 00:33:50,185 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6146916146916147 [2025-03-15 00:33:50,186 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 608 predicate places. [2025-03-15 00:33:50,186 INFO L471 AbstractCegarLoop]: Abstraction has has 723 places, 2605 transitions, 273753 flow [2025-03-15 00:33:50,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:50,186 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:50,186 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] [2025-03-15 00:33:50,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-15 00:33:50,186 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:33:50,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash 72503404, now seen corresponding path program 41 times [2025-03-15 00:33:50,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:50,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503842597] [2025-03-15 00:33:50,187 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:33:50,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:50,195 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:33:50,195 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:50,429 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:33:50,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:33:50,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503842597] [2025-03-15 00:33:50,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503842597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:33:50,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:33:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:33:50,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078764393] [2025-03-15 00:33:50,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:33:50,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:33:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:33:50,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:33:50,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:33:50,430 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:33:50,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 2605 transitions, 273753 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:50,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:33:50,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:33:50,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:59,560 INFO L124 PetriNetUnfolderBase]: 2147/6523 cut-off events. [2025-03-15 00:33:59,560 INFO L125 PetriNetUnfolderBase]: For 1319049/1329477 co-relation queries the response was YES. [2025-03-15 00:33:59,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275585 conditions, 6523 events. 2147/6523 cut-off events. For 1319049/1329477 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 57452 event pairs, 56 based on Foata normal form. 86/6503 useless extension candidates. Maximal degree in co-relation 274607. Up to 3529 conditions per place. [2025-03-15 00:33:59,665 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 405 selfloop transitions, 15 changer transitions 1775/2239 dead transitions. [2025-03-15 00:33:59,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 735 places, 2239 transitions, 238545 flow [2025-03-15 00:33:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:33:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:33:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 868 transitions. [2025-03-15 00:33:59,666 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6015246015246015 [2025-03-15 00:33:59,666 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 620 predicate places. [2025-03-15 00:33:59,666 INFO L471 AbstractCegarLoop]: Abstraction has has 735 places, 2239 transitions, 238545 flow [2025-03-15 00:33:59,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:33:59,667 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:59,667 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] [2025-03-15 00:33:59,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-15 00:33:59,667 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:33:59,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash 403948576, now seen corresponding path program 42 times [2025-03-15 00:33:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:59,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501387405] [2025-03-15 00:33:59,668 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:33:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:59,676 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:33:59,676 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:00,158 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:34:00,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:00,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501387405] [2025-03-15 00:34:00,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501387405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:00,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:00,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:34:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064281576] [2025-03-15 00:34:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:00,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:34:00,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:00,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:34:00,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:34:00,159 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:34:00,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 735 places, 2239 transitions, 238545 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:00,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:00,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:34:00,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:07,068 INFO L124 PetriNetUnfolderBase]: 2160/6585 cut-off events. [2025-03-15 00:34:07,068 INFO L125 PetriNetUnfolderBase]: For 1374340/1384554 co-relation queries the response was YES. [2025-03-15 00:34:07,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282859 conditions, 6585 events. 2160/6585 cut-off events. For 1374340/1384554 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 58158 event pairs, 65 based on Foata normal form. 89/6570 useless extension candidates. Maximal degree in co-relation 281862. Up to 3568 conditions per place. [2025-03-15 00:34:07,179 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 374 selfloop transitions, 32 changer transitions 1816/2266 dead transitions. [2025-03-15 00:34:07,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 2266 transitions, 245937 flow [2025-03-15 00:34:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:34:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:34:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 840 transitions. [2025-03-15 00:34:07,180 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5821205821205822 [2025-03-15 00:34:07,181 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 632 predicate places. [2025-03-15 00:34:07,181 INFO L471 AbstractCegarLoop]: Abstraction has has 747 places, 2266 transitions, 245937 flow [2025-03-15 00:34:07,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:07,181 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:07,181 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] [2025-03-15 00:34:07,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-15 00:34:07,181 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:34:07,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:07,182 INFO L85 PathProgramCache]: Analyzing trace with hash 346154900, now seen corresponding path program 43 times [2025-03-15 00:34:07,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:07,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473633420] [2025-03-15 00:34:07,182 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:34:07,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:07,341 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:34:07,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473633420] [2025-03-15 00:34:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473633420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:07,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:07,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:34:07,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594471403] [2025-03-15 00:34:07,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:07,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:34:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:07,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:34:07,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:34:07,343 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:34:07,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 2266 transitions, 245937 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:07,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:07,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:34:07,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:15,892 INFO L124 PetriNetUnfolderBase]: 2801/8144 cut-off events. [2025-03-15 00:34:15,892 INFO L125 PetriNetUnfolderBase]: For 1769920/1780199 co-relation queries the response was YES. [2025-03-15 00:34:16,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354574 conditions, 8144 events. 2801/8144 cut-off events. For 1769920/1780199 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 74028 event pairs, 114 based on Foata normal form. 122/8074 useless extension candidates. Maximal degree in co-relation 353558. Up to 4689 conditions per place. [2025-03-15 00:34:16,231 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 668 selfloop transitions, 33 changer transitions 1940/2685 dead transitions. [2025-03-15 00:34:16,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 2685 transitions, 298109 flow [2025-03-15 00:34:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:34:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:34:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 860 transitions. [2025-03-15 00:34:16,232 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5959805959805959 [2025-03-15 00:34:16,232 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 644 predicate places. [2025-03-15 00:34:16,232 INFO L471 AbstractCegarLoop]: Abstraction has has 759 places, 2685 transitions, 298109 flow [2025-03-15 00:34:16,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:16,233 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:16,233 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] [2025-03-15 00:34:16,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-15 00:34:16,233 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:34:16,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash -514334946, now seen corresponding path program 44 times [2025-03-15 00:34:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:16,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506428819] [2025-03-15 00:34:16,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:34:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:16,242 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:34:16,242 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:16,472 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:34:16,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:16,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506428819] [2025-03-15 00:34:16,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506428819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:16,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:16,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:34:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323698990] [2025-03-15 00:34:16,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:16,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:34:16,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:16,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:34:16,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:34:16,473 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:34:16,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 2685 transitions, 298109 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:16,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:16,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:34:16,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:25,916 INFO L124 PetriNetUnfolderBase]: 2205/6749 cut-off events. [2025-03-15 00:34:25,916 INFO L125 PetriNetUnfolderBase]: For 1519583/1529910 co-relation queries the response was YES. [2025-03-15 00:34:25,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300522 conditions, 6749 events. 2205/6749 cut-off events. For 1519583/1529910 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 60053 event pairs, 65 based on Foata normal form. 109/6754 useless extension candidates. Maximal degree in co-relation 299487. Up to 3681 conditions per place. [2025-03-15 00:34:26,043 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 386 selfloop transitions, 17 changer transitions 1882/2329 dead transitions. [2025-03-15 00:34:26,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 771 places, 2329 transitions, 262065 flow [2025-03-15 00:34:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:34:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:34:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 836 transitions. [2025-03-15 00:34:26,044 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5793485793485793 [2025-03-15 00:34:26,044 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 656 predicate places. [2025-03-15 00:34:26,044 INFO L471 AbstractCegarLoop]: Abstraction has has 771 places, 2329 transitions, 262065 flow [2025-03-15 00:34:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:26,045 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:26,045 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] [2025-03-15 00:34:26,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-15 00:34:26,045 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:34:26,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash -550681282, now seen corresponding path program 45 times [2025-03-15 00:34:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:26,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747515827] [2025-03-15 00:34:26,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:34:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:26,054 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:34:26,054 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:26,194 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:34:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747515827] [2025-03-15 00:34:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747515827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:34:26,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763137714] [2025-03-15 00:34:26,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:26,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:34:26,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:26,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:34:26,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:34:26,196 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:34:26,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 771 places, 2329 transitions, 262065 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:26,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:26,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:34:26,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:35,930 INFO L124 PetriNetUnfolderBase]: 2831/8267 cut-off events. [2025-03-15 00:34:35,930 INFO L125 PetriNetUnfolderBase]: For 1940533/1952051 co-relation queries the response was YES. [2025-03-15 00:34:35,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372962 conditions, 8267 events. 2831/8267 cut-off events. For 1940533/1952051 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 75638 event pairs, 112 based on Foata normal form. 109/8184 useless extension candidates. Maximal degree in co-relation 371908. Up to 4773 conditions per place. [2025-03-15 00:34:36,096 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 651 selfloop transitions, 34 changer transitions 2003/2732 dead transitions. [2025-03-15 00:34:36,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 2732 transitions, 314177 flow [2025-03-15 00:34:36,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:34:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:34:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 875 transitions. [2025-03-15 00:34:36,097 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6063756063756064 [2025-03-15 00:34:36,098 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 668 predicate places. [2025-03-15 00:34:36,098 INFO L471 AbstractCegarLoop]: Abstraction has has 783 places, 2732 transitions, 314177 flow [2025-03-15 00:34:36,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:36,098 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:36,098 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] [2025-03-15 00:34:36,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-15 00:34:36,098 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:34:36,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:36,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1534756094, now seen corresponding path program 46 times [2025-03-15 00:34:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247380553] [2025-03-15 00:34:36,099 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:34:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:36,108 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:34:36,108 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:36,724 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:34:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247380553] [2025-03-15 00:34:36,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247380553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:36,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:36,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 00:34:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770440565] [2025-03-15 00:34:36,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:36,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:34:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:36,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:34:36,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-15 00:34:36,725 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 111 [2025-03-15 00:34:36,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 783 places, 2732 transitions, 314177 flow. Second operand has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:36,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:36,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 111 [2025-03-15 00:34:36,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:50,226 INFO L124 PetriNetUnfolderBase]: 2917/8485 cut-off events. [2025-03-15 00:34:50,227 INFO L125 PetriNetUnfolderBase]: For 2053064/2064235 co-relation queries the response was YES. [2025-03-15 00:34:50,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389390 conditions, 8485 events. 2917/8485 cut-off events. For 2053064/2064235 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 77984 event pairs, 101 based on Foata normal form. 66/8356 useless extension candidates. Maximal degree in co-relation 388325. Up to 4923 conditions per place. [2025-03-15 00:34:50,364 INFO L140 encePairwiseOnDemand]: 86/111 looper letters, 650 selfloop transitions, 139 changer transitions 2021/2863 dead transitions. [2025-03-15 00:34:50,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 803 places, 2863 transitions, 335151 flow [2025-03-15 00:34:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:34:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:34:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1565 transitions. [2025-03-15 00:34:50,365 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6713856713856714 [2025-03-15 00:34:50,365 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 688 predicate places. [2025-03-15 00:34:50,366 INFO L471 AbstractCegarLoop]: Abstraction has has 803 places, 2863 transitions, 335151 flow [2025-03-15 00:34:50,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 58.266666666666666) internal successors, (874), 15 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:50,366 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:50,366 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] [2025-03-15 00:34:50,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-15 00:34:50,366 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:34:50,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash -60195724, now seen corresponding path program 47 times [2025-03-15 00:34:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:50,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819867078] [2025-03-15 00:34:50,367 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:34:50,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:50,376 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:34:50,376 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:50,635 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:34:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:50,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819867078] [2025-03-15 00:34:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819867078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:50,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:34:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987058885] [2025-03-15 00:34:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:50,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:34:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:50,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:34:50,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:34:50,636 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:34:50,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 803 places, 2863 transitions, 335151 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:34:50,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:50,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:34:50,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:04,812 INFO L124 PetriNetUnfolderBase]: 2902/8486 cut-off events. [2025-03-15 00:35:04,813 INFO L125 PetriNetUnfolderBase]: For 2136392/2148105 co-relation queries the response was YES. [2025-03-15 00:35:04,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395814 conditions, 8486 events. 2902/8486 cut-off events. For 2136392/2148105 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 78172 event pairs, 103 based on Foata normal form. 91/8382 useless extension candidates. Maximal degree in co-relation 394730. Up to 4921 conditions per place. [2025-03-15 00:35:04,965 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 739 selfloop transitions, 35 changer transitions 2048/2866 dead transitions. [2025-03-15 00:35:04,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 815 places, 2866 transitions, 341107 flow [2025-03-15 00:35:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:35:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:35:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 890 transitions. [2025-03-15 00:35:04,966 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6167706167706167 [2025-03-15 00:35:04,967 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 700 predicate places. [2025-03-15 00:35:04,967 INFO L471 AbstractCegarLoop]: Abstraction has has 815 places, 2866 transitions, 341107 flow [2025-03-15 00:35:04,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:35:04,967 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:04,967 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] [2025-03-15 00:35:04,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-15 00:35:04,967 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:35:04,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2105266944, now seen corresponding path program 9 times [2025-03-15 00:35:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:04,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977946421] [2025-03-15 00:35:04,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:35:04,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:04,976 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:35:04,976 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:05,212 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:35:05,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977946421] [2025-03-15 00:35:05,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977946421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:05,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:05,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:35:05,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749873344] [2025-03-15 00:35:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:05,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:35:05,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:05,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:35:05,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:35:05,213 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:35:05,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 815 places, 2866 transitions, 341107 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:35:05,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:05,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:35:05,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:15,783 INFO L124 PetriNetUnfolderBase]: 2220/6876 cut-off events. [2025-03-15 00:35:15,783 INFO L125 PetriNetUnfolderBase]: For 1795590/1807938 co-relation queries the response was YES. [2025-03-15 00:35:15,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327467 conditions, 6876 events. 2220/6876 cut-off events. For 1795590/1807938 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 61854 event pairs, 65 based on Foata normal form. 64/6836 useless extension candidates. Maximal degree in co-relation 326364. Up to 3763 conditions per place. [2025-03-15 00:35:15,887 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 336 selfloop transitions, 27 changer transitions 1971/2378 dead transitions. [2025-03-15 00:35:15,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 2378 transitions, 286301 flow [2025-03-15 00:35:15,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:35:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:35:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 853 transitions. [2025-03-15 00:35:15,888 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5911295911295912 [2025-03-15 00:35:15,889 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 706 predicate places. [2025-03-15 00:35:15,889 INFO L471 AbstractCegarLoop]: Abstraction has has 821 places, 2378 transitions, 286301 flow [2025-03-15 00:35:15,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:35:15,889 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:15,889 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] [2025-03-15 00:35:15,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-15 00:35:15,889 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-15 00:35:15,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1862196548, now seen corresponding path program 48 times [2025-03-15 00:35:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:15,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142578745] [2025-03-15 00:35:15,890 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:35:15,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:15,898 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:35:15,898 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:16,150 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:35:16,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:16,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142578745] [2025-03-15 00:35:16,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142578745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:16,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:16,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 00:35:16,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995625995] [2025-03-15 00:35:16,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:16,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 00:35:16,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:16,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 00:35:16,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-15 00:35:16,152 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 111 [2025-03-15 00:35:16,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 821 places, 2378 transitions, 286301 flow. Second operand has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:35:16,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:16,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 111 [2025-03-15 00:35:16,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:23,137 INFO L124 PetriNetUnfolderBase]: 1557/5112 cut-off events. [2025-03-15 00:35:23,138 INFO L125 PetriNetUnfolderBase]: For 1446336/1459354 co-relation queries the response was YES. [2025-03-15 00:35:23,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254417 conditions, 5112 events. 1557/5112 cut-off events. For 1446336/1459354 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 44618 event pairs, 16 based on Foata normal form. 61/5167 useless extension candidates. Maximal degree in co-relation 253295. Up to 2622 conditions per place. [2025-03-15 00:35:23,202 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 0 selfloop transitions, 0 changer transitions 1919/1919 dead transitions. [2025-03-15 00:35:23,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 1919 transitions, 233415 flow [2025-03-15 00:35:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:35:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:35:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 826 transitions. [2025-03-15 00:35:23,203 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5724185724185724 [2025-03-15 00:35:23,208 INFO L298 CegarLoopForPetriNet]: 115 programPoint places, 713 predicate places. [2025-03-15 00:35:23,209 INFO L471 AbstractCegarLoop]: Abstraction has has 828 places, 1919 transitions, 233415 flow [2025-03-15 00:35:23,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 50.23076923076923) internal successors, (653), 13 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:35:23,218 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/06-symbeq_15-list_entry_nr.i_petrified1_AllErrorsAtOnce [2025-03-15 00:35:23,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-03-15 00:35:23,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-15 00:35:23,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-15 00:35:23,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-15 00:35:23,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-15 00:35:23,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-15 00:35:23,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-03-15 00:35:23,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-15 00:35:23,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-15 00:35:23,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-15 00:35:23,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-15 00:35:23,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-15 00:35:23,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-15 00:35:23,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-15 00:35:23,384 INFO L422 BasicCegarLoop]: Path program histogram: [48, 9, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:35:23,392 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:35:23,392 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:35:23,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:35:23 BasicIcfg [2025-03-15 00:35:23,401 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:35:23,402 INFO L158 Benchmark]: Toolchain (without parser) took 333671.07ms. Allocated memory was 71.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 41.3MB in the beginning and 1.0GB in the end (delta: -993.8MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-03-15 00:35:23,402 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 71.3MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:35:23,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.95ms. Allocated memory is still 71.3MB. Free memory was 41.0MB in the beginning and 18.0MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-03-15 00:35:23,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.70ms. Allocated memory is still 71.3MB. Free memory was 18.0MB in the beginning and 42.4MB in the end (delta: -24.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2025-03-15 00:35:23,406 INFO L158 Benchmark]: Boogie Preprocessor took 31.34ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 40.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:35:23,406 INFO L158 Benchmark]: RCFGBuilder took 330.00ms. Allocated memory is still 71.3MB. Free memory was 40.8MB in the beginning and 24.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 00:35:23,406 INFO L158 Benchmark]: TraceAbstraction took 332857.83ms. Allocated memory was 71.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 23.6MB in the beginning and 1.0GB in the end (delta: -1.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-03-15 00:35:23,407 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 71.3MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 387.95ms. Allocated memory is still 71.3MB. Free memory was 41.0MB in the beginning and 18.0MB in the end (delta: 23.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.70ms. Allocated memory is still 71.3MB. Free memory was 18.0MB in the beginning and 42.4MB in the end (delta: -24.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.34ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 40.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 330.00ms. Allocated memory is still 71.3MB. Free memory was 40.8MB in the beginning and 24.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 332857.83ms. Allocated memory was 71.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 23.6MB in the beginning and 1.0GB in the end (delta: -1.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3010]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3011]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 2995]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3013]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3005]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 149 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 332.7s, OverallIterations: 64, TraceHistogramMax: 1, PathProgramHistogramMax: 48, EmptinessCheckTime: 0.0s, AutomataDifference: 314.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18235 SdHoareTripleChecker+Valid, 24.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18235 mSDsluCounter, 44454 SdHoareTripleChecker+Invalid, 19.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37255 mSDsCounter, 501 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51194 IncrementalHoareTripleChecker+Invalid, 51695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 501 mSolverCounterUnsat, 7199 mSDtfsCounter, 51194 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1394 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 1196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3034 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341107occurred in iteration=62, InterpolantAutomatonStates: 844, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 4199 NumberOfCodeBlocks, 4199 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 4135 ConstructedInterpolants, 0 QuantifiedInterpolants, 19557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 64 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:35:23,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...