/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/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:03:21,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:03:21,127 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:03:21,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:03:21,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:03:21,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:03:21,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:03:21,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:03:21,177 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:03:21,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:03:21,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:03:21,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:03:21,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:03:21,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:03:21,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:03:21,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:03:21,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:03:21,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:03:21,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:03:21,179 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:03:21,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:03:21,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:03:21,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:03:21,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:03:21,442 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:03:21,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2025-03-15 00:03:22,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96102174/5a7bf14096f6491883584d853484fb7c/FLAG263967ac3 [2025-03-15 00:03:23,028 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:03:23,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2025-03-15 00:03:23,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96102174/5a7bf14096f6491883584d853484fb7c/FLAG263967ac3 [2025-03-15 00:03:23,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96102174/5a7bf14096f6491883584d853484fb7c [2025-03-15 00:03:23,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:03:23,332 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:03:23,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:03:23,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:03:23,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:03:23,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:23,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6646c61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23, skipping insertion in model container [2025-03-15 00:03:23,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:23,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:03:23,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:03:23,737 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:03:23,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:03:23,872 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:03:23,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23 WrapperNode [2025-03-15 00:03:23,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:03:23,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:03:23,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:03:23,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:03:23,879 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:03:23" (1/1) ... [2025-03-15 00:03:23,902 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:03:23" (1/1) ... [2025-03-15 00:03:23,955 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 518 [2025-03-15 00:03:23,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:03:23,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:03:23,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:03:23,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:03:23,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:23,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:23,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:23,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:24,012 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:24,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:24,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:24,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:24,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:24,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:03:24,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:03:24,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:03:24,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:03:24,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (1/1) ... [2025-03-15 00:03:24,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:03:24,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:03:24,075 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:03:24,078 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:03:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 00:03:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 00:03:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 00:03:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 00:03:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:03:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:03:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:03:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:03:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:03:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:03:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:03:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:03:24,098 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:03:24,239 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:03:24,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:03:24,972 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:03:24,972 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:03:25,022 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:03:25,022 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:03:25,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:03:25 BoogieIcfgContainer [2025-03-15 00:03:25,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:03:25,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:03:25,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:03:25,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:03:25,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:03:23" (1/3) ... [2025-03-15 00:03:25,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6d6756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:03:25, skipping insertion in model container [2025-03-15 00:03:25,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:23" (2/3) ... [2025-03-15 00:03:25,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6d6756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:03:25, skipping insertion in model container [2025-03-15 00:03:25,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:03:25" (3/3) ... [2025-03-15 00:03:25,033 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-15 00:03:25,048 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:03:25,051 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 577 locations, 1 initial locations, 2 loop locations, and 42 error locations. [2025-03-15 00:03:25,051 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:03:25,209 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:03:25,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:03:25,261 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;@58ef393d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:03:25,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-03-15 00:03:25,303 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:03:25,303 INFO L124 PetriNetUnfolderBase]: 0/77 cut-off events. [2025-03-15 00:03:25,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:03:25,305 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:25,306 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:03:25,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:03:25,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:25,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1170600069, now seen corresponding path program 1 times [2025-03-15 00:03:25,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:25,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521981279] [2025-03-15 00:03:25,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:25,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:25,560 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:03:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:25,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521981279] [2025-03-15 00:03:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521981279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:25,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:25,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:03:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396652652] [2025-03-15 00:03:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:25,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:03:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:25,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:03:25,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:03:25,599 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 592 [2025-03-15 00:03:25,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 592 transitions, 1198 flow. Second operand has 3 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:25,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:25,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 592 [2025-03-15 00:03:25,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:26,218 INFO L124 PetriNetUnfolderBase]: 118/2007 cut-off events. [2025-03-15 00:03:26,218 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-15 00:03:26,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2214 conditions, 2007 events. 118/2007 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 9735 event pairs, 65 based on Foata normal form. 33/1814 useless extension candidates. Maximal degree in co-relation 2001. Up to 169 conditions per place. [2025-03-15 00:03:26,243 INFO L140 encePairwiseOnDemand]: 584/592 looper letters, 21 selfloop transitions, 2 changer transitions 5/573 dead transitions. [2025-03-15 00:03:26,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 573 transitions, 1208 flow [2025-03-15 00:03:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:03:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:03:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1699 transitions. [2025-03-15 00:03:26,263 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9566441441441441 [2025-03-15 00:03:26,266 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, -11 predicate places. [2025-03-15 00:03:26,266 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 573 transitions, 1208 flow [2025-03-15 00:03:26,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:26,267 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:26,267 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:03:26,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:03:26,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:03:26,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1279395922, now seen corresponding path program 1 times [2025-03-15 00:03:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:26,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354591573] [2025-03-15 00:03:26,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:26,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:26,382 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:03:26,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354591573] [2025-03-15 00:03:26,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354591573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:26,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:26,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:03:26,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176567698] [2025-03-15 00:03:26,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:26,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:03:26,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:26,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:03:26,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:03:26,387 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 556 out of 592 [2025-03-15 00:03:26,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 573 transitions, 1208 flow. Second operand has 3 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:26,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:26,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 556 of 592 [2025-03-15 00:03:26,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:26,960 INFO L124 PetriNetUnfolderBase]: 193/2736 cut-off events. [2025-03-15 00:03:26,960 INFO L125 PetriNetUnfolderBase]: For 217/290 co-relation queries the response was YES. [2025-03-15 00:03:26,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3237 conditions, 2736 events. 193/2736 cut-off events. For 217/290 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 16226 event pairs, 125 based on Foata normal form. 0/2396 useless extension candidates. Maximal degree in co-relation 2861. Up to 225 conditions per place. [2025-03-15 00:03:26,978 INFO L140 encePairwiseOnDemand]: 589/592 looper letters, 21 selfloop transitions, 2 changer transitions 5/572 dead transitions. [2025-03-15 00:03:26,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 572 transitions, 1256 flow [2025-03-15 00:03:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:03:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:03:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1694 transitions. [2025-03-15 00:03:26,984 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9538288288288288 [2025-03-15 00:03:26,985 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, -10 predicate places. [2025-03-15 00:03:26,985 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 572 transitions, 1256 flow [2025-03-15 00:03:26,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:26,986 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:26,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, 1, 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:03:26,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:03:26,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:03:26,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash -555946860, now seen corresponding path program 1 times [2025-03-15 00:03:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541067476] [2025-03-15 00:03:26,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:26,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:27,578 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:03:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541067476] [2025-03-15 00:03:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541067476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:27,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:03:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282723741] [2025-03-15 00:03:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:27,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:03:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:27,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:03:27,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:03:27,584 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 592 [2025-03-15 00:03:27,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 572 transitions, 1256 flow. Second operand has 6 states, 6 states have (on average 361.5) internal successors, (2169), 6 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:27,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:27,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 592 [2025-03-15 00:03:27,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:32,392 INFO L124 PetriNetUnfolderBase]: 7872/23693 cut-off events. [2025-03-15 00:03:32,393 INFO L125 PetriNetUnfolderBase]: For 4546/5111 co-relation queries the response was YES. [2025-03-15 00:03:32,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41948 conditions, 23693 events. 7872/23693 cut-off events. For 4546/5111 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 208684 event pairs, 7234 based on Foata normal form. 0/20560 useless extension candidates. Maximal degree in co-relation 41198. Up to 15176 conditions per place. [2025-03-15 00:03:32,562 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 215 selfloop transitions, 5 changer transitions 5/571 dead transitions. [2025-03-15 00:03:32,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 571 transitions, 1696 flow [2025-03-15 00:03:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:03:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:03:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2382 transitions. [2025-03-15 00:03:32,566 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6706081081081081 [2025-03-15 00:03:32,567 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, -6 predicate places. [2025-03-15 00:03:32,567 INFO L471 AbstractCegarLoop]: Abstraction has has 577 places, 571 transitions, 1696 flow [2025-03-15 00:03:32,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 361.5) internal successors, (2169), 6 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:32,568 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:32,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:03:32,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:03:32,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash -565203407, now seen corresponding path program 1 times [2025-03-15 00:03:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:32,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837574555] [2025-03-15 00:03:32,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:33,002 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:03:33,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:33,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837574555] [2025-03-15 00:03:33,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837574555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:33,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:33,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:03:33,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542486128] [2025-03-15 00:03:33,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:33,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:03:33,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:33,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:03:33,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:03:33,006 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 592 [2025-03-15 00:03:33,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 571 transitions, 1696 flow. Second operand has 6 states, 6 states have (on average 362.5) internal successors, (2175), 6 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:33,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:33,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 592 [2025-03-15 00:03:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:37,724 INFO L124 PetriNetUnfolderBase]: 7872/23692 cut-off events. [2025-03-15 00:03:37,724 INFO L125 PetriNetUnfolderBase]: For 6622/7987 co-relation queries the response was YES. [2025-03-15 00:03:37,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57126 conditions, 23692 events. 7872/23692 cut-off events. For 6622/7987 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 208810 event pairs, 7234 based on Foata normal form. 0/20560 useless extension candidates. Maximal degree in co-relation 56216. Up to 15175 conditions per place. [2025-03-15 00:03:37,892 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 214 selfloop transitions, 5 changer transitions 5/570 dead transitions. [2025-03-15 00:03:37,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 570 transitions, 2132 flow [2025-03-15 00:03:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:03:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:03:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2381 transitions. [2025-03-15 00:03:37,897 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6703265765765766 [2025-03-15 00:03:37,898 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, -2 predicate places. [2025-03-15 00:03:37,898 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 570 transitions, 2132 flow [2025-03-15 00:03:37,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 362.5) internal successors, (2175), 6 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:37,899 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:37,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:03:37,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:03:37,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash -367142962, now seen corresponding path program 1 times [2025-03-15 00:03:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:37,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730082401] [2025-03-15 00:03:37,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:37,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:38,324 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:03:38,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:38,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730082401] [2025-03-15 00:03:38,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730082401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:38,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:38,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:03:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191743648] [2025-03-15 00:03:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:38,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:03:38,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:38,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:03:38,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:03:38,329 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 592 [2025-03-15 00:03:38,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 570 transitions, 2132 flow. Second operand has 6 states, 6 states have (on average 363.5) internal successors, (2181), 6 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:38,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:38,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 592 [2025-03-15 00:03:38,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:42,756 INFO L124 PetriNetUnfolderBase]: 7872/23691 cut-off events. [2025-03-15 00:03:42,757 INFO L125 PetriNetUnfolderBase]: For 10183/12348 co-relation queries the response was YES. [2025-03-15 00:03:42,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72302 conditions, 23691 events. 7872/23691 cut-off events. For 10183/12348 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 208769 event pairs, 7234 based on Foata normal form. 0/20560 useless extension candidates. Maximal degree in co-relation 71234. Up to 15174 conditions per place. [2025-03-15 00:03:42,949 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 213 selfloop transitions, 5 changer transitions 5/569 dead transitions. [2025-03-15 00:03:42,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 569 transitions, 2564 flow [2025-03-15 00:03:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:03:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:03:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2380 transitions. [2025-03-15 00:03:42,956 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.670045045045045 [2025-03-15 00:03:42,958 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 2 predicate places. [2025-03-15 00:03:42,958 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 569 transitions, 2564 flow [2025-03-15 00:03:42,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 363.5) internal successors, (2181), 6 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:42,960 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:42,961 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:03:42,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:03:42,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:03:42,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:42,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1474276695, now seen corresponding path program 1 times [2025-03-15 00:03:42,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:42,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393177710] [2025-03-15 00:03:42,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:42,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:43,516 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:03:43,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393177710] [2025-03-15 00:03:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393177710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:43,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:43,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:03:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480280132] [2025-03-15 00:03:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:43,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:03:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:43,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:03:43,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:03:43,524 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 592 [2025-03-15 00:03:43,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 569 transitions, 2564 flow. Second operand has 6 states, 6 states have (on average 366.8333333333333) internal successors, (2201), 6 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:43,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:43,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 592 [2025-03-15 00:03:43,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:48,163 INFO L124 PetriNetUnfolderBase]: 7872/23690 cut-off events. [2025-03-15 00:03:48,163 INFO L125 PetriNetUnfolderBase]: For 15220/18185 co-relation queries the response was YES. [2025-03-15 00:03:48,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87473 conditions, 23690 events. 7872/23690 cut-off events. For 15220/18185 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 208759 event pairs, 7234 based on Foata normal form. 0/20560 useless extension candidates. Maximal degree in co-relation 86252. Up to 15173 conditions per place. [2025-03-15 00:03:48,344 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 209 selfloop transitions, 5 changer transitions 5/568 dead transitions. [2025-03-15 00:03:48,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 568 transitions, 2986 flow [2025-03-15 00:03:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:03:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:03:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2394 transitions. [2025-03-15 00:03:48,348 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6739864864864865 [2025-03-15 00:03:48,351 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 6 predicate places. [2025-03-15 00:03:48,351 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 568 transitions, 2986 flow [2025-03-15 00:03:48,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.8333333333333) internal successors, (2201), 6 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:48,352 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:48,352 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:48,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:03:48,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:03:48,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:48,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1314271364, now seen corresponding path program 1 times [2025-03-15 00:03:48,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:48,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114156322] [2025-03-15 00:03:48,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:48,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:48,695 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:03:48,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:48,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114156322] [2025-03-15 00:03:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114156322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:48,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:48,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:03:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169562258] [2025-03-15 00:03:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:48,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:03:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:48,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:03:48,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:03:48,698 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 592 [2025-03-15 00:03:48,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 568 transitions, 2986 flow. Second operand has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:48,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:48,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 592 [2025-03-15 00:03:48,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:53,764 INFO L124 PetriNetUnfolderBase]: 7872/23689 cut-off events. [2025-03-15 00:03:53,764 INFO L125 PetriNetUnfolderBase]: For 21742/25507 co-relation queries the response was YES. [2025-03-15 00:03:53,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102642 conditions, 23689 events. 7872/23689 cut-off events. For 21742/25507 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 208748 event pairs, 7234 based on Foata normal form. 0/20560 useless extension candidates. Maximal degree in co-relation 101270. Up to 15172 conditions per place. [2025-03-15 00:03:53,969 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 208 selfloop transitions, 5 changer transitions 5/567 dead transitions. [2025-03-15 00:03:53,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 567 transitions, 3404 flow [2025-03-15 00:03:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:03:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:03:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2393 transitions. [2025-03-15 00:03:53,974 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.673704954954955 [2025-03-15 00:03:53,974 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 10 predicate places. [2025-03-15 00:03:53,975 INFO L471 AbstractCegarLoop]: Abstraction has has 593 places, 567 transitions, 3404 flow [2025-03-15 00:03:53,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:53,976 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:53,976 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:03:53,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:03:53,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:03:53,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash -782835635, now seen corresponding path program 1 times [2025-03-15 00:03:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:53,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520921060] [2025-03-15 00:03:53,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:54,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:03:54,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520921060] [2025-03-15 00:03:54,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520921060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:54,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:03:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221414122] [2025-03-15 00:03:54,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:54,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:03:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:54,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:03:54,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:03:54,063 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 592 [2025-03-15 00:03:54,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 567 transitions, 3404 flow. Second operand has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:54,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:54,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 592 [2025-03-15 00:03:54,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:01,076 INFO L124 PetriNetUnfolderBase]: 11540/35111 cut-off events. [2025-03-15 00:04:01,076 INFO L125 PetriNetUnfolderBase]: For 42263/48080 co-relation queries the response was YES. [2025-03-15 00:04:01,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152318 conditions, 35111 events. 11540/35111 cut-off events. For 42263/48080 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 315978 event pairs, 10279 based on Foata normal form. 123/30705 useless extension candidates. Maximal degree in co-relation 149895. Up to 22204 conditions per place. [2025-03-15 00:04:01,413 INFO L140 encePairwiseOnDemand]: 587/592 looper letters, 29 selfloop transitions, 4 changer transitions 6/581 dead transitions. [2025-03-15 00:04:01,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 581 transitions, 3632 flow [2025-03-15 00:04:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1716 transitions. [2025-03-15 00:04:01,416 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9662162162162162 [2025-03-15 00:04:01,417 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 12 predicate places. [2025-03-15 00:04:01,417 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 581 transitions, 3632 flow [2025-03-15 00:04:01,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.3333333333334) internal successors, (1687), 3 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:01,418 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:01,418 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:01,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:04:01,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:04:01,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash -275806026, now seen corresponding path program 1 times [2025-03-15 00:04:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:01,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274102101] [2025-03-15 00:04:01,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:01,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:02,051 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:04:02,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274102101] [2025-03-15 00:04:02,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274102101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:02,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:02,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:04:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127404578] [2025-03-15 00:04:02,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:02,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:02,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:02,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:02,054 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 592 [2025-03-15 00:04:02,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 581 transitions, 3632 flow. Second operand has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:02,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:02,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 592 [2025-03-15 00:04:02,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:12,465 INFO L124 PetriNetUnfolderBase]: 16964/47274 cut-off events. [2025-03-15 00:04:12,465 INFO L125 PetriNetUnfolderBase]: For 96768/108893 co-relation queries the response was YES. [2025-03-15 00:04:12,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238841 conditions, 47274 events. 16964/47274 cut-off events. For 96768/108893 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 433102 event pairs, 9146 based on Foata normal form. 141/41759 useless extension candidates. Maximal degree in co-relation 236150. Up to 30218 conditions per place. [2025-03-15 00:04:12,909 INFO L140 encePairwiseOnDemand]: 538/592 looper letters, 435 selfloop transitions, 84 changer transitions 6/863 dead transitions. [2025-03-15 00:04:12,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 863 transitions, 8110 flow [2025-03-15 00:04:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:04:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:04:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2587 transitions. [2025-03-15 00:04:12,912 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7283220720720721 [2025-03-15 00:04:12,914 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 17 predicate places. [2025-03-15 00:04:12,914 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 863 transitions, 8110 flow [2025-03-15 00:04:12,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:12,915 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:12,915 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:12,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:04:12,915 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:04:12,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash 756399191, now seen corresponding path program 1 times [2025-03-15 00:04:12,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735652879] [2025-03-15 00:04:12,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:12,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:13,081 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:04:13,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:13,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735652879] [2025-03-15 00:04:13,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735652879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:13,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:04:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970899037] [2025-03-15 00:04:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:13,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:13,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:13,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:13,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:13,086 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 592 [2025-03-15 00:04:13,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 863 transitions, 8110 flow. Second operand has 3 states, 3 states have (on average 568.0) internal successors, (1704), 3 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:13,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:13,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 592 [2025-03-15 00:04:13,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:21,017 INFO L124 PetriNetUnfolderBase]: 10685/30684 cut-off events. [2025-03-15 00:04:21,018 INFO L125 PetriNetUnfolderBase]: For 90390/100112 co-relation queries the response was YES. [2025-03-15 00:04:21,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159336 conditions, 30684 events. 10685/30684 cut-off events. For 90390/100112 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 293067 event pairs, 5544 based on Foata normal form. 258/27489 useless extension candidates. Maximal degree in co-relation 156050. Up to 19592 conditions per place. [2025-03-15 00:04:21,417 INFO L140 encePairwiseOnDemand]: 588/592 looper letters, 72 selfloop transitions, 3 changer transitions 8/872 dead transitions. [2025-03-15 00:04:21,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 872 transitions, 8635 flow [2025-03-15 00:04:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1724 transitions. [2025-03-15 00:04:21,420 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9707207207207207 [2025-03-15 00:04:21,420 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 16 predicate places. [2025-03-15 00:04:21,421 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 872 transitions, 8635 flow [2025-03-15 00:04:21,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.0) internal successors, (1704), 3 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:21,421 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:21,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:04:21,422 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:04:21,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1923749786, now seen corresponding path program 1 times [2025-03-15 00:04:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354808000] [2025-03-15 00:04:21,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:22,002 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:04:22,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354808000] [2025-03-15 00:04:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354808000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:22,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:22,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:04:22,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716389839] [2025-03-15 00:04:22,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:22,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:22,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:22,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:22,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:22,005 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 592 [2025-03-15 00:04:22,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 872 transitions, 8635 flow. Second operand has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:22,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:22,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 592 [2025-03-15 00:04:22,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:31,874 INFO L124 PetriNetUnfolderBase]: 11687/32890 cut-off events. [2025-03-15 00:04:31,875 INFO L125 PetriNetUnfolderBase]: For 113223/124345 co-relation queries the response was YES. [2025-03-15 00:04:32,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193838 conditions, 32890 events. 11687/32890 cut-off events. For 113223/124345 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 315600 event pairs, 5188 based on Foata normal form. 264/29522 useless extension candidates. Maximal degree in co-relation 190255. Up to 22256 conditions per place. [2025-03-15 00:04:32,210 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 634 selfloop transitions, 156 changer transitions 8/1132 dead transitions. [2025-03-15 00:04:32,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 1132 transitions, 14195 flow [2025-03-15 00:04:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:04:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:04:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2508 transitions. [2025-03-15 00:04:32,214 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.706081081081081 [2025-03-15 00:04:32,214 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 20 predicate places. [2025-03-15 00:04:32,214 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 1132 transitions, 14195 flow [2025-03-15 00:04:32,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,215 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:32,215 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:04:32,215 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:04:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1567699041, now seen corresponding path program 1 times [2025-03-15 00:04:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:32,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657992892] [2025-03-15 00:04:32,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:32,571 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:04:32,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:32,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657992892] [2025-03-15 00:04:32,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657992892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:32,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:32,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:04:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691594337] [2025-03-15 00:04:32,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:32,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:32,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:32,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:32,573 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 592 [2025-03-15 00:04:32,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 1132 transitions, 14195 flow. Second operand has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:32,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 592 [2025-03-15 00:04:32,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:43,615 INFO L124 PetriNetUnfolderBase]: 12090/33916 cut-off events. [2025-03-15 00:04:43,615 INFO L125 PetriNetUnfolderBase]: For 141294/159159 co-relation queries the response was YES. [2025-03-15 00:04:43,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223841 conditions, 33916 events. 12090/33916 cut-off events. For 141294/159159 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 328613 event pairs, 4419 based on Foata normal form. 261/30505 useless extension candidates. Maximal degree in co-relation 219961. Up to 23058 conditions per place. [2025-03-15 00:04:44,032 INFO L140 encePairwiseOnDemand]: 567/592 looper letters, 985 selfloop transitions, 59 changer transitions 8/1393 dead transitions. [2025-03-15 00:04:44,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 1393 transitions, 20801 flow [2025-03-15 00:04:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:04:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:04:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2538 transitions. [2025-03-15 00:04:44,039 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.714527027027027 [2025-03-15 00:04:44,039 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 24 predicate places. [2025-03-15 00:04:44,039 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 1393 transitions, 20801 flow [2025-03-15 00:04:44,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:44,040 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:44,040 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:44,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:04:44,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:04:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1450379044, now seen corresponding path program 1 times [2025-03-15 00:04:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544501813] [2025-03-15 00:04:44,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:44,453 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:04:44,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:44,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544501813] [2025-03-15 00:04:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544501813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:44,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:04:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708008040] [2025-03-15 00:04:44,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:44,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:44,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:44,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:44,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:44,457 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 592 [2025-03-15 00:04:44,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 1393 transitions, 20801 flow. Second operand has 6 states, 6 states have (on average 351.0) internal successors, (2106), 6 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:44,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:44,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 592 [2025-03-15 00:04:44,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:58,671 INFO L124 PetriNetUnfolderBase]: 12965/36018 cut-off events. [2025-03-15 00:04:58,671 INFO L125 PetriNetUnfolderBase]: For 177420/200072 co-relation queries the response was YES. [2025-03-15 00:04:58,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261980 conditions, 36018 events. 12965/36018 cut-off events. For 177420/200072 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 352160 event pairs, 3946 based on Foata normal form. 264/32454 useless extension candidates. Maximal degree in co-relation 257803. Up to 24354 conditions per place. [2025-03-15 00:04:59,104 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 1152 selfloop transitions, 156 changer transitions 8/1653 dead transitions. [2025-03-15 00:04:59,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 1653 transitions, 28433 flow [2025-03-15 00:04:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:04:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:04:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2516 transitions. [2025-03-15 00:04:59,108 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-15 00:04:59,109 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 28 predicate places. [2025-03-15 00:04:59,109 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 1653 transitions, 28433 flow [2025-03-15 00:04:59,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.0) internal successors, (2106), 6 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:59,110 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:59,110 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:59,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:04:59,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:04:59,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:59,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1305763347, now seen corresponding path program 1 times [2025-03-15 00:04:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:59,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036022072] [2025-03-15 00:04:59,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:59,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:59,679 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:04:59,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:59,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036022072] [2025-03-15 00:04:59,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036022072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:59,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:59,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:04:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276231965] [2025-03-15 00:04:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:59,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:59,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:59,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:59,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:59,682 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 592 [2025-03-15 00:04:59,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 1653 transitions, 28433 flow. Second operand has 6 states, 6 states have (on average 353.0) internal successors, (2118), 6 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:59,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:59,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 592 [2025-03-15 00:04:59,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:15,560 INFO L124 PetriNetUnfolderBase]: 13838/37849 cut-off events. [2025-03-15 00:05:15,560 INFO L125 PetriNetUnfolderBase]: For 222063/250926 co-relation queries the response was YES. [2025-03-15 00:05:15,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302420 conditions, 37849 events. 13838/37849 cut-off events. For 222063/250926 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 370972 event pairs, 3473 based on Foata normal form. 267/34134 useless extension candidates. Maximal degree in co-relation 297946. Up to 25650 conditions per place. [2025-03-15 00:05:16,116 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 1411 selfloop transitions, 156 changer transitions 8/1913 dead transitions. [2025-03-15 00:05:16,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 1913 transitions, 37101 flow [2025-03-15 00:05:16,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2515 transitions. [2025-03-15 00:05:16,120 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7080518018018018 [2025-03-15 00:05:16,121 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 32 predicate places. [2025-03-15 00:05:16,121 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 1913 transitions, 37101 flow [2025-03-15 00:05:16,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 353.0) internal successors, (2118), 6 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:16,122 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:16,122 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:16,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:05:16,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:05:16,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:16,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1313292486, now seen corresponding path program 1 times [2025-03-15 00:05:16,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:16,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748291110] [2025-03-15 00:05:16,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:16,672 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:05:16,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:16,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748291110] [2025-03-15 00:05:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748291110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:16,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:16,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:16,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604889427] [2025-03-15 00:05:16,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:16,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:16,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:16,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:16,677 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 592 [2025-03-15 00:05:16,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 1913 transitions, 37101 flow. Second operand has 6 states, 6 states have (on average 354.0) internal successors, (2124), 6 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:16,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:16,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 592 [2025-03-15 00:05:16,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:35,076 INFO L124 PetriNetUnfolderBase]: 14691/39689 cut-off events. [2025-03-15 00:05:35,076 INFO L125 PetriNetUnfolderBase]: For 271455/306542 co-relation queries the response was YES. [2025-03-15 00:05:35,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344010 conditions, 39689 events. 14691/39689 cut-off events. For 271455/306542 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 389989 event pairs, 2883 based on Foata normal form. 267/35843 useless extension candidates. Maximal degree in co-relation 339239. Up to 26821 conditions per place. [2025-03-15 00:05:35,642 INFO L140 encePairwiseOnDemand]: 543/592 looper letters, 1670 selfloop transitions, 156 changer transitions 8/2173 dead transitions. [2025-03-15 00:05:35,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 2173 transitions, 46805 flow [2025-03-15 00:05:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2514 transitions. [2025-03-15 00:05:35,646 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7077702702702703 [2025-03-15 00:05:35,647 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 36 predicate places. [2025-03-15 00:05:35,647 INFO L471 AbstractCegarLoop]: Abstraction has has 619 places, 2173 transitions, 46805 flow [2025-03-15 00:05:35,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 354.0) internal successors, (2124), 6 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:35,648 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:35,648 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:05:35,648 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:05:35,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1025115523, now seen corresponding path program 1 times [2025-03-15 00:05:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264483543] [2025-03-15 00:05:35,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:05:36,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264483543] [2025-03-15 00:05:36,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264483543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:36,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:36,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904533136] [2025-03-15 00:05:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:36,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:36,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:36,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:36,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:36,022 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 592 [2025-03-15 00:05:36,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 2173 transitions, 46805 flow. Second operand has 6 states, 6 states have (on average 356.1666666666667) internal successors, (2137), 6 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:36,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:36,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 592 [2025-03-15 00:05:36,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:58,546 INFO L124 PetriNetUnfolderBase]: 15009/40307 cut-off events. [2025-03-15 00:05:58,546 INFO L125 PetriNetUnfolderBase]: For 322741/352320 co-relation queries the response was YES. [2025-03-15 00:05:58,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373250 conditions, 40307 events. 15009/40307 cut-off events. For 322741/352320 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 395616 event pairs, 3109 based on Foata normal form. 272/36389 useless extension candidates. Maximal degree in co-relation 368123. Up to 27022 conditions per place. [2025-03-15 00:05:59,442 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 1830 selfloop transitions, 5 changer transitions 8/2188 dead transitions. [2025-03-15 00:05:59,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 2188 transitions, 50983 flow [2025-03-15 00:05:59,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2291 transitions. [2025-03-15 00:05:59,447 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6449887387387387 [2025-03-15 00:05:59,447 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 40 predicate places. [2025-03-15 00:05:59,447 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 2188 transitions, 50983 flow [2025-03-15 00:05:59,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 356.1666666666667) internal successors, (2137), 6 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:59,449 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:59,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:05:59,449 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:05:59,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash -649788469, now seen corresponding path program 1 times [2025-03-15 00:05:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:59,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828423387] [2025-03-15 00:05:59,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:59,982 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:05:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828423387] [2025-03-15 00:05:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828423387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:59,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943069930] [2025-03-15 00:05:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:59,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:59,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:59,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:59,986 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 592 [2025-03-15 00:05:59,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 2188 transitions, 50983 flow. Second operand has 6 states, 6 states have (on average 374.6666666666667) internal successors, (2248), 6 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:59,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:59,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 592 [2025-03-15 00:05:59,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:22,743 INFO L124 PetriNetUnfolderBase]: 15029/40322 cut-off events. [2025-03-15 00:06:22,743 INFO L125 PetriNetUnfolderBase]: For 383303/416770 co-relation queries the response was YES. [2025-03-15 00:06:22,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399271 conditions, 40322 events. 15029/40322 cut-off events. For 383303/416770 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 396001 event pairs, 3077 based on Foata normal form. 271/36408 useless extension candidates. Maximal degree in co-relation 393845. Up to 27037 conditions per place. [2025-03-15 00:06:23,412 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 1824 selfloop transitions, 5 changer transitions 8/2203 dead transitions. [2025-03-15 00:06:23,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 2203 transitions, 55179 flow [2025-03-15 00:06:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:06:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:06:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2395 transitions. [2025-03-15 00:06:23,416 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6742680180180181 [2025-03-15 00:06:23,416 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 44 predicate places. [2025-03-15 00:06:23,416 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 2203 transitions, 55179 flow [2025-03-15 00:06:23,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 374.6666666666667) internal successors, (2248), 6 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:23,417 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:23,417 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:23,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:06:23,417 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:06:23,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1931934961, now seen corresponding path program 1 times [2025-03-15 00:06:23,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:23,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323316653] [2025-03-15 00:06:23,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:23,782 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:06:23,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:23,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323316653] [2025-03-15 00:06:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323316653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:06:23,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:06:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024147879] [2025-03-15 00:06:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:23,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:06:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:23,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:06:23,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:06:23,784 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 592 [2025-03-15 00:06:23,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 2203 transitions, 55179 flow. Second operand has 6 states, 6 states have (on average 375.6666666666667) internal successors, (2254), 6 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:23,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:23,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 592 [2025-03-15 00:06:23,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:46,612 INFO L124 PetriNetUnfolderBase]: 15024/40312 cut-off events. [2025-03-15 00:06:46,612 INFO L125 PetriNetUnfolderBase]: For 440876/478077 co-relation queries the response was YES. [2025-03-15 00:06:46,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424837 conditions, 40312 events. 15024/40312 cut-off events. For 440876/478077 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 395668 event pairs, 3077 based on Foata normal form. 259/36391 useless extension candidates. Maximal degree in co-relation 419112. Up to 27027 conditions per place. [2025-03-15 00:06:47,336 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 1839 selfloop transitions, 5 changer transitions 8/2218 dead transitions. [2025-03-15 00:06:47,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 2218 transitions, 59435 flow [2025-03-15 00:06:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:06:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:06:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2394 transitions. [2025-03-15 00:06:47,340 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6739864864864865 [2025-03-15 00:06:47,340 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 48 predicate places. [2025-03-15 00:06:47,340 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 2218 transitions, 59435 flow [2025-03-15 00:06:47,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.6666666666667) internal successors, (2254), 6 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:47,341 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:47,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:06:47,341 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:06:47,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1006788546, now seen corresponding path program 1 times [2025-03-15 00:06:47,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:47,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230105902] [2025-03-15 00:06:47,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:47,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:47,414 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:06:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230105902] [2025-03-15 00:06:47,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230105902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:47,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:06:47,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:06:47,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295461130] [2025-03-15 00:06:47,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:47,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:06:47,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:47,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:06:47,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:06:47,416 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 592 [2025-03-15 00:06:47,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 2218 transitions, 59435 flow. Second operand has 3 states, 3 states have (on average 562.6666666666666) internal successors, (1688), 3 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:47,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:47,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 592 [2025-03-15 00:06:47,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:07:23,660 INFO L124 PetriNetUnfolderBase]: 22616/60478 cut-off events. [2025-03-15 00:07:23,661 INFO L125 PetriNetUnfolderBase]: For 792180/893566 co-relation queries the response was YES. [2025-03-15 00:07:24,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641423 conditions, 60478 events. 22616/60478 cut-off events. For 792180/893566 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 586147 event pairs, 4506 based on Foata normal form. 603/54822 useless extension candidates. Maximal degree in co-relation 632383. Up to 40515 conditions per place. [2025-03-15 00:07:24,704 INFO L140 encePairwiseOnDemand]: 587/592 looper letters, 566 selfloop transitions, 4 changer transitions 12/2466 dead transitions. [2025-03-15 00:07:24,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 2466 transitions, 69913 flow [2025-03-15 00:07:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:07:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:07:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1715 transitions. [2025-03-15 00:07:24,708 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9656531531531531 [2025-03-15 00:07:24,708 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 50 predicate places. [2025-03-15 00:07:24,708 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 2466 transitions, 69913 flow [2025-03-15 00:07:24,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.6666666666666) internal successors, (1688), 3 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:07:24,709 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:07:24,709 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:24,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:07:24,709 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:07:24,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:07:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash 960849008, now seen corresponding path program 1 times [2025-03-15 00:07:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:07:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576426436] [2025-03-15 00:07:24,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:07:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:07:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:07:25,329 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:07:25,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:07:25,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576426436] [2025-03-15 00:07:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576426436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:07:25,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:07:25,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:07:25,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125046371] [2025-03-15 00:07:25,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:07:25,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:07:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:07:25,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:07:25,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:07:25,332 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 592 [2025-03-15 00:07:25,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 2466 transitions, 69913 flow. Second operand has 6 states, 6 states have (on average 358.6666666666667) internal successors, (2152), 6 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:07:25,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:07:25,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 592 [2025-03-15 00:07:25,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:08:17,221 INFO L124 PetriNetUnfolderBase]: 24993/66525 cut-off events. [2025-03-15 00:08:17,221 INFO L125 PetriNetUnfolderBase]: For 932958/1053836 co-relation queries the response was YES. [2025-03-15 00:08:17,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736029 conditions, 66525 events. 24993/66525 cut-off events. For 932958/1053836 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 646746 event pairs, 4830 based on Foata normal form. 617/60071 useless extension candidates. Maximal degree in co-relation 726129. Up to 43588 conditions per place. [2025-03-15 00:08:18,547 INFO L140 encePairwiseOnDemand]: 549/592 looper letters, 2268 selfloop transitions, 150 changer transitions 12/2775 dead transitions. [2025-03-15 00:08:18,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 2775 transitions, 84563 flow [2025-03-15 00:08:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:08:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:08:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2496 transitions. [2025-03-15 00:08:18,551 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2025-03-15 00:08:18,551 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 55 predicate places. [2025-03-15 00:08:18,551 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 2775 transitions, 84563 flow [2025-03-15 00:08:18,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 358.6666666666667) internal successors, (2152), 6 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:08:18,552 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:08:18,552 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:18,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:08:18,552 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:08:18,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:08:18,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2032702540, now seen corresponding path program 1 times [2025-03-15 00:08:18,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:08:18,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859283976] [2025-03-15 00:08:18,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:08:18,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:08:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:08:18,670 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:08:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:08:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859283976] [2025-03-15 00:08:18,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859283976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:08:18,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:08:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:08:18,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061811074] [2025-03-15 00:08:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:08:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:08:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:08:18,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:08:18,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:08:18,674 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 592 [2025-03-15 00:08:18,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 2775 transitions, 84563 flow. Second operand has 3 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:08:18,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:08:18,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 592 [2025-03-15 00:08:18,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:12,219 INFO L124 PetriNetUnfolderBase]: 25070/67064 cut-off events. [2025-03-15 00:09:12,220 INFO L125 PetriNetUnfolderBase]: For 1064151/1187778 co-relation queries the response was YES. [2025-03-15 00:09:12,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744237 conditions, 67064 events. 25070/67064 cut-off events. For 1064151/1187778 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 653761 event pairs, 4830 based on Foata normal form. 619/60558 useless extension candidates. Maximal degree in co-relation 734000. Up to 43794 conditions per place. [2025-03-15 00:09:13,880 INFO L140 encePairwiseOnDemand]: 587/592 looper letters, 654 selfloop transitions, 5 changer transitions 12/2790 dead transitions. [2025-03-15 00:09:13,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 2790 transitions, 86349 flow [2025-03-15 00:09:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:09:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:09:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1706 transitions. [2025-03-15 00:09:13,882 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9605855855855856 [2025-03-15 00:09:13,882 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 57 predicate places. [2025-03-15 00:09:13,882 INFO L471 AbstractCegarLoop]: Abstraction has has 640 places, 2790 transitions, 86349 flow [2025-03-15 00:09:13,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:09:13,883 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:13,883 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:13,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 00:09:13,883 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:09:13,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1255320950, now seen corresponding path program 1 times [2025-03-15 00:09:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271534747] [2025-03-15 00:09:13,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:13,962 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:09:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271534747] [2025-03-15 00:09:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271534747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:13,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:13,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167355462] [2025-03-15 00:09:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:13,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:13,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:13,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:13,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:13,964 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 592 [2025-03-15 00:09:13,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 2790 transitions, 86349 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:09:13,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:13,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 592 [2025-03-15 00:09:13,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:11,573 INFO L124 PetriNetUnfolderBase]: 25159/67818 cut-off events. [2025-03-15 00:10:11,574 INFO L125 PetriNetUnfolderBase]: For 1216429/1348602 co-relation queries the response was YES. [2025-03-15 00:10:12,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754596 conditions, 67818 events. 25159/67818 cut-off events. For 1216429/1348602 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 663540 event pairs, 4829 based on Foata normal form. 730/61372 useless extension candidates. Maximal degree in co-relation 744050. Up to 44098 conditions per place. [2025-03-15 00:10:13,014 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 666 selfloop transitions, 9 changer transitions 12/2811 dead transitions. [2025-03-15 00:10:13,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 2811 transitions, 88182 flow [2025-03-15 00:10:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:10:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:10:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2025-03-15 00:10:13,016 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9622747747747747 [2025-03-15 00:10:13,017 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 59 predicate places. [2025-03-15 00:10:13,017 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 2811 transitions, 88182 flow [2025-03-15 00:10:13,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:13,017 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:13,017 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:10:13,018 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:13,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1832997636, now seen corresponding path program 1 times [2025-03-15 00:10:13,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:13,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222168030] [2025-03-15 00:10:13,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:13,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:13,251 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:10:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:13,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222168030] [2025-03-15 00:10:13,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222168030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:13,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:13,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:10:13,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37141311] [2025-03-15 00:10:13,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:13,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:10:13,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:13,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:10:13,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:10:13,254 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 592 [2025-03-15 00:10:13,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 2811 transitions, 88182 flow. Second operand has 3 states, 3 states have (on average 569.3333333333334) internal successors, (1708), 3 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:13,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:13,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 592 [2025-03-15 00:10:13,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:16,763 INFO L124 PetriNetUnfolderBase]: 1002/4238 cut-off events. [2025-03-15 00:10:16,764 INFO L125 PetriNetUnfolderBase]: For 179627/180307 co-relation queries the response was YES. [2025-03-15 00:10:16,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38214 conditions, 4238 events. 1002/4238 cut-off events. For 179627/180307 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 27682 event pairs, 513 based on Foata normal form. 773/4647 useless extension candidates. Maximal degree in co-relation 30994. Up to 2318 conditions per place. [2025-03-15 00:10:16,819 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 123 selfloop transitions, 30 changer transitions 16/697 dead transitions. [2025-03-15 00:10:16,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 697 transitions, 15106 flow [2025-03-15 00:10:16,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:10:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:10:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1717 transitions. [2025-03-15 00:10:16,821 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9667792792792793 [2025-03-15 00:10:16,822 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 48 predicate places. [2025-03-15 00:10:16,822 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 697 transitions, 15106 flow [2025-03-15 00:10:16,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 569.3333333333334) internal successors, (1708), 3 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:16,822 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:16,823 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:16,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 00:10:16,823 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:16,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:16,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1462888240, now seen corresponding path program 1 times [2025-03-15 00:10:16,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:16,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510708335] [2025-03-15 00:10:16,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:17,524 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:10:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510708335] [2025-03-15 00:10:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510708335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:10:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811009622] [2025-03-15 00:10:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:17,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:10:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:17,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:10:17,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:10:17,528 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 592 [2025-03-15 00:10:17,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 697 transitions, 15106 flow. Second operand has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:17,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:17,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 592 [2025-03-15 00:10:17,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:19,555 INFO L124 PetriNetUnfolderBase]: 994/4183 cut-off events. [2025-03-15 00:10:19,555 INFO L125 PetriNetUnfolderBase]: For 116665/117088 co-relation queries the response was YES. [2025-03-15 00:10:19,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39859 conditions, 4183 events. 994/4183 cut-off events. For 116665/117088 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 27194 event pairs, 474 based on Foata normal form. 3/3867 useless extension candidates. Maximal degree in co-relation 31986. Up to 2274 conditions per place. [2025-03-15 00:10:19,619 INFO L140 encePairwiseOnDemand]: 583/592 looper letters, 335 selfloop transitions, 6 changer transitions 16/702 dead transitions. [2025-03-15 00:10:19,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 702 transitions, 16124 flow [2025-03-15 00:10:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:10:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:10:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2346 transitions. [2025-03-15 00:10:19,621 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.660472972972973 [2025-03-15 00:10:19,622 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 50 predicate places. [2025-03-15 00:10:19,622 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 702 transitions, 16124 flow [2025-03-15 00:10:19,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:19,622 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:19,623 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:19,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 00:10:19,623 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:19,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1786512972, now seen corresponding path program 1 times [2025-03-15 00:10:19,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:19,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068209454] [2025-03-15 00:10:19,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:19,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:20,260 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:10:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:20,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068209454] [2025-03-15 00:10:20,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068209454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:20,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:20,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:10:20,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202780322] [2025-03-15 00:10:20,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:20,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:10:20,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:20,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:10:20,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:10:20,263 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 592 [2025-03-15 00:10:20,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 702 transitions, 16124 flow. Second operand has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:20,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:20,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 592 [2025-03-15 00:10:20,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:22,335 INFO L124 PetriNetUnfolderBase]: 986/4174 cut-off events. [2025-03-15 00:10:22,335 INFO L125 PetriNetUnfolderBase]: For 126137/126552 co-relation queries the response was YES. [2025-03-15 00:10:22,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41530 conditions, 4174 events. 986/4174 cut-off events. For 126137/126552 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 27244 event pairs, 476 based on Foata normal form. 3/3869 useless extension candidates. Maximal degree in co-relation 33342. Up to 2254 conditions per place. [2025-03-15 00:10:22,386 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 344 selfloop transitions, 5 changer transitions 16/709 dead transitions. [2025-03-15 00:10:22,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 709 transitions, 17236 flow [2025-03-15 00:10:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:10:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:10:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-03-15 00:10:22,388 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6582207207207207 [2025-03-15 00:10:22,388 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 54 predicate places. [2025-03-15 00:10:22,388 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 709 transitions, 17236 flow [2025-03-15 00:10:22,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:22,389 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:22,389 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 00:10:22,389 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:22,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash 101646757, now seen corresponding path program 1 times [2025-03-15 00:10:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:22,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909809299] [2025-03-15 00:10:22,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:22,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:22,984 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:10:22,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:22,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909809299] [2025-03-15 00:10:22,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909809299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:22,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:10:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717537822] [2025-03-15 00:10:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:22,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:10:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:22,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:10:22,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:10:22,987 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 592 [2025-03-15 00:10:22,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 709 transitions, 17236 flow. Second operand has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:22,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:22,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 592 [2025-03-15 00:10:22,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:24,793 INFO L124 PetriNetUnfolderBase]: 976/4141 cut-off events. [2025-03-15 00:10:24,793 INFO L125 PetriNetUnfolderBase]: For 135509/135984 co-relation queries the response was YES. [2025-03-15 00:10:24,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43087 conditions, 4141 events. 976/4141 cut-off events. For 135509/135984 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 26903 event pairs, 453 based on Foata normal form. 3/3853 useless extension candidates. Maximal degree in co-relation 34646. Up to 2232 conditions per place. [2025-03-15 00:10:24,844 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 350 selfloop transitions, 5 changer transitions 16/716 dead transitions. [2025-03-15 00:10:24,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 716 transitions, 18374 flow [2025-03-15 00:10:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:10:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:10:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2342 transitions. [2025-03-15 00:10:24,847 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6593468468468469 [2025-03-15 00:10:24,847 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 58 predicate places. [2025-03-15 00:10:24,847 INFO L471 AbstractCegarLoop]: Abstraction has has 641 places, 716 transitions, 18374 flow [2025-03-15 00:10:24,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.0) internal successors, (2274), 6 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:24,847 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:24,848 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:24,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 00:10:24,848 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:24,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1831325270, now seen corresponding path program 1 times [2025-03-15 00:10:24,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:24,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447625273] [2025-03-15 00:10:24,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:25,457 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:10:25,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447625273] [2025-03-15 00:10:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447625273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:25,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:25,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:10:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232140748] [2025-03-15 00:10:25,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:25,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:10:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:25,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:10:25,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:10:25,460 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 592 [2025-03-15 00:10:25,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 716 transitions, 18374 flow. Second operand has 6 states, 6 states have (on average 378.1666666666667) internal successors, (2269), 6 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:25,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:25,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 592 [2025-03-15 00:10:25,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:27,579 INFO L124 PetriNetUnfolderBase]: 970/4123 cut-off events. [2025-03-15 00:10:27,579 INFO L125 PetriNetUnfolderBase]: For 146800/147301 co-relation queries the response was YES. [2025-03-15 00:10:27,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44767 conditions, 4123 events. 970/4123 cut-off events. For 146800/147301 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 26793 event pairs, 450 based on Foata normal form. 3/3849 useless extension candidates. Maximal degree in co-relation 35961. Up to 2214 conditions per place. [2025-03-15 00:10:27,633 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 359 selfloop transitions, 5 changer transitions 16/723 dead transitions. [2025-03-15 00:10:27,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 723 transitions, 19544 flow [2025-03-15 00:10:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:10:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:10:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2331 transitions. [2025-03-15 00:10:27,636 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-15 00:10:27,636 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 62 predicate places. [2025-03-15 00:10:27,636 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 723 transitions, 19544 flow [2025-03-15 00:10:27,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.1666666666667) internal successors, (2269), 6 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:27,637 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:27,639 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:27,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 00:10:27,639 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:27,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash -958837191, now seen corresponding path program 1 times [2025-03-15 00:10:27,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:27,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146253290] [2025-03-15 00:10:27,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:28,346 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:10:28,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146253290] [2025-03-15 00:10:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146253290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:28,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:10:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507195852] [2025-03-15 00:10:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:10:28,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:28,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:10:28,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:10:28,350 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 592 [2025-03-15 00:10:28,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 723 transitions, 19544 flow. Second operand has 6 states, 6 states have (on average 380.1666666666667) internal successors, (2281), 6 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:28,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:28,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 592 [2025-03-15 00:10:28,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:30,703 INFO L124 PetriNetUnfolderBase]: 964/4105 cut-off events. [2025-03-15 00:10:30,703 INFO L125 PetriNetUnfolderBase]: For 158871/159398 co-relation queries the response was YES. [2025-03-15 00:10:30,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46427 conditions, 4105 events. 964/4105 cut-off events. For 158871/159398 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 26635 event pairs, 437 based on Foata normal form. 3/3845 useless extension candidates. Maximal degree in co-relation 37256. Up to 2196 conditions per place. [2025-03-15 00:10:30,769 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 366 selfloop transitions, 5 changer transitions 16/730 dead transitions. [2025-03-15 00:10:30,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 730 transitions, 20742 flow [2025-03-15 00:10:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:10:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:10:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2330 transitions. [2025-03-15 00:10:30,771 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6559684684684685 [2025-03-15 00:10:30,772 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 66 predicate places. [2025-03-15 00:10:30,772 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 730 transitions, 20742 flow [2025-03-15 00:10:30,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.1666666666667) internal successors, (2281), 6 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:30,773 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:30,773 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:30,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 00:10:30,773 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:30,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash 120860948, now seen corresponding path program 1 times [2025-03-15 00:10:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528047154] [2025-03-15 00:10:30,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:31,457 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:10:31,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:31,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528047154] [2025-03-15 00:10:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528047154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:31,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:31,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:10:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642401790] [2025-03-15 00:10:31,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:31,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:10:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:31,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:10:31,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:10:31,459 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 592 [2025-03-15 00:10:31,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 730 transitions, 20742 flow. Second operand has 6 states, 6 states have (on average 382.1666666666667) internal successors, (2293), 6 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:31,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:31,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 592 [2025-03-15 00:10:31,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:33,670 INFO L124 PetriNetUnfolderBase]: 966/4142 cut-off events. [2025-03-15 00:10:33,670 INFO L125 PetriNetUnfolderBase]: For 171055/171566 co-relation queries the response was YES. [2025-03-15 00:10:33,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48190 conditions, 4142 events. 966/4142 cut-off events. For 171055/171566 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 27009 event pairs, 452 based on Foata normal form. 3/3891 useless extension candidates. Maximal degree in co-relation 38638. Up to 2186 conditions per place. [2025-03-15 00:10:33,741 INFO L140 encePairwiseOnDemand]: 586/592 looper letters, 373 selfloop transitions, 5 changer transitions 16/738 dead transitions. [2025-03-15 00:10:33,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 738 transitions, 21980 flow [2025-03-15 00:10:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:10:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:10:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2335 transitions. [2025-03-15 00:10:33,743 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6573761261261262 [2025-03-15 00:10:33,744 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 70 predicate places. [2025-03-15 00:10:33,744 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 738 transitions, 21980 flow [2025-03-15 00:10:33,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 382.1666666666667) internal successors, (2293), 6 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:33,745 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:33,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 00:10:33,745 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:33,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:33,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1421548539, now seen corresponding path program 1 times [2025-03-15 00:10:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:33,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897974077] [2025-03-15 00:10:33,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:34,486 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:10:34,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:34,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897974077] [2025-03-15 00:10:34,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897974077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:34,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:34,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:10:34,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615976110] [2025-03-15 00:10:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:34,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:10:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:34,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:10:34,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:10:34,489 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 592 [2025-03-15 00:10:34,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 738 transitions, 21980 flow. Second operand has 6 states, 6 states have (on average 367.0) internal successors, (2202), 6 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:34,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:34,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 592 [2025-03-15 00:10:34,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:39,494 INFO L124 PetriNetUnfolderBase]: 2606/9073 cut-off events. [2025-03-15 00:10:39,494 INFO L125 PetriNetUnfolderBase]: For 290734/291210 co-relation queries the response was YES. [2025-03-15 00:10:39,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91395 conditions, 9073 events. 2606/9073 cut-off events. For 290734/291210 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 62630 event pairs, 1895 based on Foata normal form. 0/8364 useless extension candidates. Maximal degree in co-relation 80502. Up to 4739 conditions per place. [2025-03-15 00:10:39,705 INFO L140 encePairwiseOnDemand]: 585/592 looper letters, 411 selfloop transitions, 6 changer transitions 18/762 dead transitions. [2025-03-15 00:10:39,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 762 transitions, 24128 flow [2025-03-15 00:10:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:10:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:10:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-15 00:10:39,708 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6345720720720721 [2025-03-15 00:10:39,708 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 74 predicate places. [2025-03-15 00:10:39,709 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 762 transitions, 24128 flow [2025-03-15 00:10:39,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.0) internal successors, (2202), 6 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:39,709 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:39,709 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:39,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 00:10:39,710 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:39,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2054359902, now seen corresponding path program 1 times [2025-03-15 00:10:39,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:39,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913445252] [2025-03-15 00:10:39,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:39,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:10:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913445252] [2025-03-15 00:10:39,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913445252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:39,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:39,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:10:39,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985823468] [2025-03-15 00:10:39,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:39,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:10:39,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:39,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:10:39,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:10:39,896 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 592 [2025-03-15 00:10:39,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 762 transitions, 24128 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:39,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:39,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 592 [2025-03-15 00:10:39,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:44,101 INFO L124 PetriNetUnfolderBase]: 2608/9063 cut-off events. [2025-03-15 00:10:44,101 INFO L125 PetriNetUnfolderBase]: For 307106/307614 co-relation queries the response was YES. [2025-03-15 00:10:44,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92246 conditions, 9063 events. 2608/9063 cut-off events. For 307106/307614 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 62553 event pairs, 1895 based on Foata normal form. 0/8366 useless extension candidates. Maximal degree in co-relation 81039. Up to 4739 conditions per place. [2025-03-15 00:10:44,218 INFO L140 encePairwiseOnDemand]: 589/592 looper letters, 221 selfloop transitions, 2 changer transitions 18/763 dead transitions. [2025-03-15 00:10:44,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 763 transitions, 24724 flow [2025-03-15 00:10:44,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:10:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:10:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1696 transitions. [2025-03-15 00:10:44,220 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.954954954954955 [2025-03-15 00:10:44,220 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 75 predicate places. [2025-03-15 00:10:44,220 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 763 transitions, 24724 flow [2025-03-15 00:10:44,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:44,221 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:44,221 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:44,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 00:10:44,221 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2025-03-15 00:10:44,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:44,232 INFO L85 PathProgramCache]: Analyzing trace with hash -600021104, now seen corresponding path program 1 times [2025-03-15 00:10:44,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:44,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757304245] [2025-03-15 00:10:44,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:44,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:44,385 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:10:44,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:44,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757304245] [2025-03-15 00:10:44,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757304245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:44,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:44,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:10:44,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793275192] [2025-03-15 00:10:44,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:44,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:10:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:44,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:10:44,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:10:44,391 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 592 [2025-03-15 00:10:44,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 763 transitions, 24724 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:44,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:44,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 592 [2025-03-15 00:10:44,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:48,415 INFO L124 PetriNetUnfolderBase]: 2610/9059 cut-off events. [2025-03-15 00:10:48,415 INFO L125 PetriNetUnfolderBase]: For 324122/324650 co-relation queries the response was YES. [2025-03-15 00:10:48,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93155 conditions, 9059 events. 2610/9059 cut-off events. For 324122/324650 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 62583 event pairs, 1895 based on Foata normal form. 0/8368 useless extension candidates. Maximal degree in co-relation 81640. Up to 4739 conditions per place. [2025-03-15 00:10:48,549 INFO L140 encePairwiseOnDemand]: 589/592 looper letters, 0 selfloop transitions, 0 changer transitions 763/763 dead transitions. [2025-03-15 00:10:48,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 763 transitions, 25259 flow [2025-03-15 00:10:48,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:10:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:10:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1696 transitions. [2025-03-15 00:10:48,552 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.954954954954955 [2025-03-15 00:10:48,552 INFO L298 CegarLoopForPetriNet]: 583 programPoint places, 76 predicate places. [2025-03-15 00:10:48,552 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 763 transitions, 25259 flow [2025-03-15 00:10:48,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:48,580 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/queue.i_petrified1_AllErrorsAtOnce [2025-03-15 00:10:48,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (78 of 79 remaining) [2025-03-15 00:10:48,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-03-15 00:10:48,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-03-15 00:10:48,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-03-15 00:10:48,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-03-15 00:10:48,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-03-15 00:10:48,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-03-15 00:10:48,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 79 remaining) [2025-03-15 00:10:48,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (70 of 79 remaining) [2025-03-15 00:10:48,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-03-15 00:10:48,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-03-15 00:10:48,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-03-15 00:10:48,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-03-15 00:10:48,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err13ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err14ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err15ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err16ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-03-15 00:10:48,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err18ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err17ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err19ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err20ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err21ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err22ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err10ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err11ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-03-15 00:10:48,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-03-15 00:10:48,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-03-15 00:10:48,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-03-15 00:10:48,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err13ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err14ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err15ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err16ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err18ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err17ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err19ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err20ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err21ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err22ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-03-15 00:10:48,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-03-15 00:10:48,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-03-15 00:10:48,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err10ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-03-15 00:10:48,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err11ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-03-15 00:10:48,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 00:10:48,919 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-15 00:10:48,926 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:10:48,926 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:10:48,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:10:48 BasicIcfg [2025-03-15 00:10:48,932 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:10:48,932 INFO L158 Benchmark]: Toolchain (without parser) took 445600.48ms. Allocated memory was 71.3MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 42.3MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-03-15 00:10:48,932 INFO L158 Benchmark]: CDTParser took 1.29ms. Allocated memory is still 71.3MB. Free memory was 34.2MB in the beginning and 34.2MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:10:48,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.79ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 33.6MB in the end (delta: 8.5MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2025-03-15 00:10:48,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.80ms. Allocated memory is still 71.3MB. Free memory was 33.6MB in the beginning and 28.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-03-15 00:10:48,935 INFO L158 Benchmark]: Boogie Preprocessor took 85.06ms. Allocated memory is still 71.3MB. Free memory was 28.1MB in the beginning and 23.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:10:48,935 INFO L158 Benchmark]: RCFGBuilder took 981.57ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.0MB in the beginning and 28.7MB in the end (delta: -5.7MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2025-03-15 00:10:48,935 INFO L158 Benchmark]: TraceAbstraction took 443905.88ms. Allocated memory was 88.1MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 27.7MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-03-15 00:10:48,936 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.29ms. Allocated memory is still 71.3MB. Free memory was 34.2MB in the beginning and 34.2MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 540.79ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 33.6MB in the end (delta: 8.5MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.80ms. Allocated memory is still 71.3MB. Free memory was 33.6MB in the beginning and 28.1MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 85.06ms. Allocated memory is still 71.3MB. Free memory was 28.1MB in the beginning and 23.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 981.57ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.0MB in the beginning and 28.7MB in the end (delta: -5.7MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * TraceAbstraction took 443905.88ms. Allocated memory was 88.1MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 27.7MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1055]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1056]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 955]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 956]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 980]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 980]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 981]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 981]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 982]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 988]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 984]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 988]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1013]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1021]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 980]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 980]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 981]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 981]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 982]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 988]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 984]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 988]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1025]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1026]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1027]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1040]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 995]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 995]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 996]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 996]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 997]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1002]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 999]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1002]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1042]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1045]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1046]: 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 5 procedures, 979 locations, 79 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: 443.7s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 429.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 833 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 833 mSDsluCounter, 4398 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14972 IncrementalHoareTripleChecker+Invalid, 15349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 377 mSolverCounterUnsat, 4398 mSDtfsCounter, 14972 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88182occurred in iteration=22, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 8037 NumberOfCodeBlocks, 8037 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8005 ConstructedInterpolants, 0 QuantifiedInterpolants, 10261 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:10:48,963 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...