./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:05:44,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:05:44,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:05:44,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:05:44,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:05:44,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:05:44,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:05:44,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:05:44,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:05:44,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:05:44,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:05:44,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:05:44,954 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:05:44,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:05:44,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:05:44,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:05:44,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:05:44,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:05:44,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:05:44,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:05:44,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:05:44,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:05:44,956 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:05:44,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:05:44,956 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:05:44,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:05:44,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:05:44,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:05:44,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:05:44,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:05:44,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:05:44,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-03-08 22:05:45,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:05:45,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:05:45,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:05:45,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:05:45,183 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:05:45,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-08 22:05:46,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de250668d/fa7798e6b540403f935fe7613b04f408/FLAGcd4794bad [2025-03-08 22:05:46,480 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:05:46,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-08 22:05:46,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de250668d/fa7798e6b540403f935fe7613b04f408/FLAGcd4794bad [2025-03-08 22:05:46,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de250668d/fa7798e6b540403f935fe7613b04f408 [2025-03-08 22:05:46,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:05:46,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:05:46,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:05:46,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:05:46,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:05:46,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4017ef47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46, skipping insertion in model container [2025-03-08 22:05:46,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:05:46,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:05:46,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:05:46,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:05:46,739 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:05:46,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46 WrapperNode [2025-03-08 22:05:46,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:05:46,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:05:46,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:05:46,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:05:46,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,766 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 185 [2025-03-08 22:05:46,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:05:46,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:05:46,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:05:46,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:05:46,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:05:46,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:05:46,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:05:46,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:05:46,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (1/1) ... [2025-03-08 22:05:46,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:05:46,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:05:46,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:05:46,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:05:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:05:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:05:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:05:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:05:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:05:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:05:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:05:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:05:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:05:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:05:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:05:46,844 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:05:46,915 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:05:46,917 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:05:47,351 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:05:47,351 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:05:47,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:05:47,365 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:05:47,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:47 BoogieIcfgContainer [2025-03-08 22:05:47,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:05:47,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:05:47,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:05:47,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:05:47,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:05:46" (1/3) ... [2025-03-08 22:05:47,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd718b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:05:47, skipping insertion in model container [2025-03-08 22:05:47,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:46" (2/3) ... [2025-03-08 22:05:47,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd718b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:05:47, skipping insertion in model container [2025-03-08 22:05:47,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:47" (3/3) ... [2025-03-08 22:05:47,374 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-03-08 22:05:47,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:05:47,385 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 450 locations, 1 initial locations, 4 loop locations, and 54 error locations. [2025-03-08 22:05:47,385 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:05:47,501 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:05:47,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 473 transitions, 960 flow [2025-03-08 22:05:47,663 INFO L124 PetriNetUnfolderBase]: 24/471 cut-off events. [2025-03-08 22:05:47,664 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:05:47,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 471 events. 24/471 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1105 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 290. Up to 3 conditions per place. [2025-03-08 22:05:47,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 473 transitions, 960 flow [2025-03-08 22:05:47,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 436 places, 451 transitions, 914 flow [2025-03-08 22:05:47,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:05:47,695 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=LoopHeads, 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;@125f2718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:05:47,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-03-08 22:05:47,699 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:05:47,699 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 22:05:47,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:05:47,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:47,700 INFO L206 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] [2025-03-08 22:05:47,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:47,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:47,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1977631769, now seen corresponding path program 1 times [2025-03-08 22:05:47,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283234231] [2025-03-08 22:05:47,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:47,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:05:47,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:05:47,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:47,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:47,846 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-08 22:05:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283234231] [2025-03-08 22:05:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283234231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:47,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386602597] [2025-03-08 22:05:47,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:47,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:47,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:47,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:47,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-03-08 22:05:47,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 451 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:47,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:47,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-03-08 22:05:47,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:48,055 INFO L124 PetriNetUnfolderBase]: 37/782 cut-off events. [2025-03-08 22:05:48,055 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-08 22:05:48,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 782 events. 37/782 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3435 event pairs, 8 based on Foata normal form. 13/648 useless extension candidates. Maximal degree in co-relation 591. Up to 28 conditions per place. [2025-03-08 22:05:48,061 INFO L140 encePairwiseOnDemand]: 462/473 looper letters, 11 selfloop transitions, 2 changer transitions 6/442 dead transitions. [2025-03-08 22:05:48,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 442 transitions, 922 flow [2025-03-08 22:05:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1366 transitions. [2025-03-08 22:05:48,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9626497533474278 [2025-03-08 22:05:48,073 INFO L175 Difference]: Start difference. First operand has 436 places, 451 transitions, 914 flow. Second operand 3 states and 1366 transitions. [2025-03-08 22:05:48,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 442 transitions, 922 flow [2025-03-08 22:05:48,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 442 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:05:48,087 INFO L231 Difference]: Finished difference. Result has 433 places, 436 transitions, 880 flow [2025-03-08 22:05:48,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=433, PETRI_TRANSITIONS=436} [2025-03-08 22:05:48,093 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -3 predicate places. [2025-03-08 22:05:48,094 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 436 transitions, 880 flow [2025-03-08 22:05:48,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:48,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:48,095 INFO L206 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] [2025-03-08 22:05:48,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:05:48,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:48,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1683597137, now seen corresponding path program 1 times [2025-03-08 22:05:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117020423] [2025-03-08 22:05:48,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:48,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:05:48,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:05:48,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:48,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:48,148 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-08 22:05:48,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:48,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117020423] [2025-03-08 22:05:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117020423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:48,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394010027] [2025-03-08 22:05:48,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:48,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:48,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:48,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:48,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-03-08 22:05:48,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 436 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:48,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:48,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-03-08 22:05:48,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:48,312 INFO L124 PetriNetUnfolderBase]: 37/766 cut-off events. [2025-03-08 22:05:48,312 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:05:48,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 766 events. 37/766 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3396 event pairs, 8 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 772. Up to 28 conditions per place. [2025-03-08 22:05:48,316 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-03-08 22:05:48,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 435 transitions, 904 flow [2025-03-08 22:05:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-08 22:05:48,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-08 22:05:48,321 INFO L175 Difference]: Start difference. First operand has 433 places, 436 transitions, 880 flow. Second operand 3 states and 1358 transitions. [2025-03-08 22:05:48,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 435 transitions, 904 flow [2025-03-08 22:05:48,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 435 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:48,329 INFO L231 Difference]: Finished difference. Result has 426 places, 435 transitions, 878 flow [2025-03-08 22:05:48,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=426, PETRI_TRANSITIONS=435} [2025-03-08 22:05:48,330 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -10 predicate places. [2025-03-08 22:05:48,330 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 435 transitions, 878 flow [2025-03-08 22:05:48,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:48,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:48,332 INFO L206 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] [2025-03-08 22:05:48,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:05:48,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:48,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -473707422, now seen corresponding path program 1 times [2025-03-08 22:05:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:48,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125909187] [2025-03-08 22:05:48,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:48,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:05:48,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:05:48,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:48,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:48,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-08 22:05:48,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:48,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125909187] [2025-03-08 22:05:48,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125909187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:48,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:48,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:48,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284000996] [2025-03-08 22:05:48,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:48,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:48,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:48,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:48,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:48,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-03-08 22:05:48,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 435 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:48,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:48,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-03-08 22:05:48,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:48,523 INFO L124 PetriNetUnfolderBase]: 37/756 cut-off events. [2025-03-08 22:05:48,524 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-08 22:05:48,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 756 events. 37/756 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3139 event pairs, 8 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 758. Up to 32 conditions per place. [2025-03-08 22:05:48,528 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-03-08 22:05:48,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 434 transitions, 904 flow [2025-03-08 22:05:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:48,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2025-03-08 22:05:48,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9556025369978859 [2025-03-08 22:05:48,531 INFO L175 Difference]: Start difference. First operand has 426 places, 435 transitions, 878 flow. Second operand 3 states and 1356 transitions. [2025-03-08 22:05:48,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 434 transitions, 904 flow [2025-03-08 22:05:48,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 434 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:48,536 INFO L231 Difference]: Finished difference. Result has 425 places, 434 transitions, 876 flow [2025-03-08 22:05:48,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=425, PETRI_TRANSITIONS=434} [2025-03-08 22:05:48,537 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-03-08 22:05:48,537 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 434 transitions, 876 flow [2025-03-08 22:05:48,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:48,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:48,538 INFO L206 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] [2025-03-08 22:05:48,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:05:48,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:48,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash 203158289, now seen corresponding path program 1 times [2025-03-08 22:05:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:48,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332504703] [2025-03-08 22:05:48,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:48,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:05:48,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:05:48,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:48,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:48,586 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-08 22:05:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:48,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332504703] [2025-03-08 22:05:48,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332504703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:48,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:48,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85596177] [2025-03-08 22:05:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:48,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:48,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:48,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:48,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-03-08 22:05:48,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 434 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:48,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:48,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-03-08 22:05:48,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:48,696 INFO L124 PetriNetUnfolderBase]: 36/761 cut-off events. [2025-03-08 22:05:48,696 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-08 22:05:48,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 761 events. 36/761 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3188 event pairs, 8 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 753. Up to 30 conditions per place. [2025-03-08 22:05:48,701 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-03-08 22:05:48,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 433 transitions, 902 flow [2025-03-08 22:05:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2025-03-08 22:05:48,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9556025369978859 [2025-03-08 22:05:48,703 INFO L175 Difference]: Start difference. First operand has 425 places, 434 transitions, 876 flow. Second operand 3 states and 1356 transitions. [2025-03-08 22:05:48,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 433 transitions, 902 flow [2025-03-08 22:05:48,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 433 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:48,708 INFO L231 Difference]: Finished difference. Result has 424 places, 433 transitions, 874 flow [2025-03-08 22:05:48,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=424, PETRI_TRANSITIONS=433} [2025-03-08 22:05:48,709 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2025-03-08 22:05:48,709 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 433 transitions, 874 flow [2025-03-08 22:05:48,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:48,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:48,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:48,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:05:48,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:48,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:48,711 INFO L85 PathProgramCache]: Analyzing trace with hash -379747242, now seen corresponding path program 1 times [2025-03-08 22:05:48,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:48,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965474811] [2025-03-08 22:05:48,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:48,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:05:48,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:05:48,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:48,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:48,754 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-08 22:05:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965474811] [2025-03-08 22:05:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965474811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:48,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:48,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104972086] [2025-03-08 22:05:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:48,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:48,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:48,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:48,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:48,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 473 [2025-03-08 22:05:48,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 433 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:48,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:48,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 473 [2025-03-08 22:05:48,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:48,906 INFO L124 PetriNetUnfolderBase]: 83/1184 cut-off events. [2025-03-08 22:05:48,906 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-08 22:05:48,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1184 events. 83/1184 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6801 event pairs, 24 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1221. Up to 81 conditions per place. [2025-03-08 22:05:48,913 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 1 changer transitions 0/428 dead transitions. [2025-03-08 22:05:48,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 428 transitions, 894 flow [2025-03-08 22:05:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2025-03-08 22:05:48,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506694855532065 [2025-03-08 22:05:48,916 INFO L175 Difference]: Start difference. First operand has 424 places, 433 transitions, 874 flow. Second operand 3 states and 1349 transitions. [2025-03-08 22:05:48,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 428 transitions, 894 flow [2025-03-08 22:05:48,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 428 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:48,922 INFO L231 Difference]: Finished difference. Result has 419 places, 428 transitions, 862 flow [2025-03-08 22:05:48,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=419, PETRI_TRANSITIONS=428} [2025-03-08 22:05:48,924 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2025-03-08 22:05:48,925 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 428 transitions, 862 flow [2025-03-08 22:05:48,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:48,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:48,926 INFO L206 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] [2025-03-08 22:05:48,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:05:48,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:48,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1401559208, now seen corresponding path program 1 times [2025-03-08 22:05:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:48,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345923651] [2025-03-08 22:05:48,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:48,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:48,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 22:05:48,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 22:05:48,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:48,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345923651] [2025-03-08 22:05:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345923651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77199523] [2025-03-08 22:05:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:49,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:49,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:49,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 473 [2025-03-08 22:05:49,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 428 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:49,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:49,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 473 [2025-03-08 22:05:49,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:49,950 INFO L124 PetriNetUnfolderBase]: 429/2642 cut-off events. [2025-03-08 22:05:49,950 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2025-03-08 22:05:49,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3364 conditions, 2642 events. 429/2642 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19514 event pairs, 288 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 3309. Up to 691 conditions per place. [2025-03-08 22:05:49,962 INFO L140 encePairwiseOnDemand]: 461/473 looper letters, 52 selfloop transitions, 10 changer transitions 0/426 dead transitions. [2025-03-08 22:05:49,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 426 transitions, 982 flow [2025-03-08 22:05:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2025-03-08 22:05:49,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661028893587033 [2025-03-08 22:05:49,966 INFO L175 Difference]: Start difference. First operand has 419 places, 428 transitions, 862 flow. Second operand 6 states and 2458 transitions. [2025-03-08 22:05:49,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 426 transitions, 982 flow [2025-03-08 22:05:49,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 426 transitions, 981 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:49,971 INFO L231 Difference]: Finished difference. Result has 421 places, 426 transitions, 877 flow [2025-03-08 22:05:49,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=877, PETRI_PLACES=421, PETRI_TRANSITIONS=426} [2025-03-08 22:05:49,972 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -15 predicate places. [2025-03-08 22:05:49,972 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 426 transitions, 877 flow [2025-03-08 22:05:49,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:49,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:49,973 INFO L206 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] [2025-03-08 22:05:49,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:05:49,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:49,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:49,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1634125223, now seen corresponding path program 1 times [2025-03-08 22:05:49,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:49,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719204927] [2025-03-08 22:05:49,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:49,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:49,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 22:05:49,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 22:05:49,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:49,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:49,999 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-08 22:05:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:49,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719204927] [2025-03-08 22:05:49,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719204927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:49,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:50,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336842473] [2025-03-08 22:05:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-03-08 22:05:50,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 426 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-03-08 22:05:50,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,086 INFO L124 PetriNetUnfolderBase]: 32/661 cut-off events. [2025-03-08 22:05:50,086 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-08 22:05:50,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 661 events. 32/661 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2482 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 675. Up to 28 conditions per place. [2025-03-08 22:05:50,090 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2025-03-08 22:05:50,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 425 transitions, 901 flow [2025-03-08 22:05:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-08 22:05:50,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-08 22:05:50,092 INFO L175 Difference]: Start difference. First operand has 421 places, 426 transitions, 877 flow. Second operand 3 states and 1358 transitions. [2025-03-08 22:05:50,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 425 transitions, 901 flow [2025-03-08 22:05:50,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 425 transitions, 881 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:50,097 INFO L231 Difference]: Finished difference. Result has 417 places, 425 transitions, 859 flow [2025-03-08 22:05:50,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=417, PETRI_TRANSITIONS=425} [2025-03-08 22:05:50,099 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -19 predicate places. [2025-03-08 22:05:50,099 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 425 transitions, 859 flow [2025-03-08 22:05:50,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,100 INFO L206 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] [2025-03-08 22:05:50,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:05:50,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:50,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash 548041319, now seen corresponding path program 1 times [2025-03-08 22:05:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659555435] [2025-03-08 22:05:50,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 22:05:50,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 22:05:50,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:50,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:50,139 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-08 22:05:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659555435] [2025-03-08 22:05:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659555435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781816927] [2025-03-08 22:05:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 473 [2025-03-08 22:05:50,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 425 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 473 [2025-03-08 22:05:50,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,241 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2025-03-08 22:05:50,241 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-03-08 22:05:50,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 1050 events. 80/1050 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5751 event pairs, 24 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1089. Up to 82 conditions per place. [2025-03-08 22:05:50,248 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2025-03-08 22:05:50,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 420 transitions, 879 flow [2025-03-08 22:05:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2025-03-08 22:05:50,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506694855532065 [2025-03-08 22:05:50,254 INFO L175 Difference]: Start difference. First operand has 417 places, 425 transitions, 859 flow. Second operand 3 states and 1349 transitions. [2025-03-08 22:05:50,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 420 transitions, 879 flow [2025-03-08 22:05:50,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 420 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:50,259 INFO L231 Difference]: Finished difference. Result has 412 places, 420 transitions, 847 flow [2025-03-08 22:05:50,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=412, PETRI_TRANSITIONS=420} [2025-03-08 22:05:50,259 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2025-03-08 22:05:50,260 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 420 transitions, 847 flow [2025-03-08 22:05:50,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,260 INFO L206 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] [2025-03-08 22:05:50,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:05:50,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:50,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1383691439, now seen corresponding path program 1 times [2025-03-08 22:05:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907514561] [2025-03-08 22:05:50,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 22:05:50,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 22:05:50,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:50,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:50,300 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-08 22:05:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907514561] [2025-03-08 22:05:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907514561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:50,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232267348] [2025-03-08 22:05:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-03-08 22:05:50,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 420 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-03-08 22:05:50,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,371 INFO L124 PetriNetUnfolderBase]: 32/651 cut-off events. [2025-03-08 22:05:50,372 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-08 22:05:50,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 651 events. 32/651 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2314 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2025-03-08 22:05:50,376 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2025-03-08 22:05:50,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 419 transitions, 871 flow [2025-03-08 22:05:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-08 22:05:50,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-08 22:05:50,378 INFO L175 Difference]: Start difference. First operand has 412 places, 420 transitions, 847 flow. Second operand 3 states and 1358 transitions. [2025-03-08 22:05:50,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 419 transitions, 871 flow [2025-03-08 22:05:50,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 419 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:50,383 INFO L231 Difference]: Finished difference. Result has 412 places, 419 transitions, 848 flow [2025-03-08 22:05:50,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=412, PETRI_TRANSITIONS=419} [2025-03-08 22:05:50,384 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2025-03-08 22:05:50,384 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 419 transitions, 848 flow [2025-03-08 22:05:50,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,386 INFO L206 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] [2025-03-08 22:05:50,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:05:50,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:50,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash -798593511, now seen corresponding path program 1 times [2025-03-08 22:05:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700594323] [2025-03-08 22:05:50,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:05:50,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:05:50,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:50,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:50,428 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-08 22:05:50,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:50,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700594323] [2025-03-08 22:05:50,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700594323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:50,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269079658] [2025-03-08 22:05:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-03-08 22:05:50,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 419 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-03-08 22:05:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,547 INFO L124 PetriNetUnfolderBase]: 73/1148 cut-off events. [2025-03-08 22:05:50,547 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:05:50,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1148 events. 73/1148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6593 event pairs, 16 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1166. Up to 58 conditions per place. [2025-03-08 22:05:50,553 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2025-03-08 22:05:50,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 418 transitions, 879 flow [2025-03-08 22:05:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-08 22:05:50,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-08 22:05:50,556 INFO L175 Difference]: Start difference. First operand has 412 places, 419 transitions, 848 flow. Second operand 3 states and 1358 transitions. [2025-03-08 22:05:50,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 418 transitions, 879 flow [2025-03-08 22:05:50,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 418 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:50,564 INFO L231 Difference]: Finished difference. Result has 409 places, 417 transitions, 850 flow [2025-03-08 22:05:50,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=409, PETRI_TRANSITIONS=417} [2025-03-08 22:05:50,566 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-03-08 22:05:50,566 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 417 transitions, 850 flow [2025-03-08 22:05:50,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,567 INFO L206 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] [2025-03-08 22:05:50,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:05:50,567 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:50,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1350811354, now seen corresponding path program 1 times [2025-03-08 22:05:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935296490] [2025-03-08 22:05:50,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 22:05:50,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 22:05:50,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:50,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:50,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935296490] [2025-03-08 22:05:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935296490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:50,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194417232] [2025-03-08 22:05:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-03-08 22:05:50,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 417 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-03-08 22:05:50,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,711 INFO L124 PetriNetUnfolderBase]: 70/1083 cut-off events. [2025-03-08 22:05:50,711 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2025-03-08 22:05:50,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 1083 events. 70/1083 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6228 event pairs, 16 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 1111. Up to 61 conditions per place. [2025-03-08 22:05:50,715 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2025-03-08 22:05:50,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 416 transitions, 881 flow [2025-03-08 22:05:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-08 22:05:50,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-08 22:05:50,718 INFO L175 Difference]: Start difference. First operand has 409 places, 417 transitions, 850 flow. Second operand 3 states and 1358 transitions. [2025-03-08 22:05:50,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 416 transitions, 881 flow [2025-03-08 22:05:50,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:50,722 INFO L231 Difference]: Finished difference. Result has 408 places, 415 transitions, 856 flow [2025-03-08 22:05:50,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=408, PETRI_TRANSITIONS=415} [2025-03-08 22:05:50,723 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2025-03-08 22:05:50,723 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 415 transitions, 856 flow [2025-03-08 22:05:50,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,724 INFO L206 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] [2025-03-08 22:05:50,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:05:50,724 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:50,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1770409525, now seen corresponding path program 1 times [2025-03-08 22:05:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961625005] [2025-03-08 22:05:50,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 22:05:50,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 22:05:50,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:50,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:50,757 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-08 22:05:50,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:50,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961625005] [2025-03-08 22:05:50,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961625005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:50,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:50,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780732696] [2025-03-08 22:05:50,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-08 22:05:50,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 415 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-08 22:05:50,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,857 INFO L124 PetriNetUnfolderBase]: 47/946 cut-off events. [2025-03-08 22:05:50,857 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:05:50,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 946 events. 47/946 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4219 event pairs, 4 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 948. Up to 20 conditions per place. [2025-03-08 22:05:50,862 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2025-03-08 22:05:50,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 415 transitions, 885 flow [2025-03-08 22:05:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-08 22:05:50,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-03-08 22:05:50,865 INFO L175 Difference]: Start difference. First operand has 408 places, 415 transitions, 856 flow. Second operand 3 states and 1362 transitions. [2025-03-08 22:05:50,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 415 transitions, 885 flow [2025-03-08 22:05:50,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:50,869 INFO L231 Difference]: Finished difference. Result has 409 places, 414 transitions, 858 flow [2025-03-08 22:05:50,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=409, PETRI_TRANSITIONS=414} [2025-03-08 22:05:50,870 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-03-08 22:05:50,870 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 414 transitions, 858 flow [2025-03-08 22:05:50,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:50,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:05:50,871 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:50,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash -889885005, now seen corresponding path program 1 times [2025-03-08 22:05:50,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018300990] [2025-03-08 22:05:50,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 22:05:50,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 22:05:50,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:50,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:50,902 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-08 22:05:50,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:50,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018300990] [2025-03-08 22:05:50,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018300990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:50,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:05:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044124282] [2025-03-08 22:05:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-03-08 22:05:50,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 414 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-03-08 22:05:50,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,971 INFO L124 PetriNetUnfolderBase]: 44/817 cut-off events. [2025-03-08 22:05:50,971 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-08 22:05:50,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 817 events. 44/817 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3828 event pairs, 6 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2025-03-08 22:05:50,976 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 11 selfloop transitions, 3 changer transitions 0/416 dead transitions. [2025-03-08 22:05:50,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 416 transitions, 891 flow [2025-03-08 22:05:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2025-03-08 22:05:50,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9640591966173362 [2025-03-08 22:05:50,978 INFO L175 Difference]: Start difference. First operand has 409 places, 414 transitions, 858 flow. Second operand 3 states and 1368 transitions. [2025-03-08 22:05:50,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 416 transitions, 891 flow [2025-03-08 22:05:50,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 416 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:50,983 INFO L231 Difference]: Finished difference. Result has 411 places, 415 transitions, 872 flow [2025-03-08 22:05:50,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=411, PETRI_TRANSITIONS=415} [2025-03-08 22:05:50,985 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2025-03-08 22:05:50,985 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 415 transitions, 872 flow [2025-03-08 22:05:50,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:50,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,986 INFO L206 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] [2025-03-08 22:05:50,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:05:50,986 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash -419150337, now seen corresponding path program 1 times [2025-03-08 22:05:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748436056] [2025-03-08 22:05:50,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 22:05:51,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 22:05:51,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:51,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:51,028 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-08 22:05:51,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748436056] [2025-03-08 22:05:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748436056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:51,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:51,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:51,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009442088] [2025-03-08 22:05:51,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:51,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:51,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:51,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:51,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:51,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-03-08 22:05:51,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 415 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:51,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:51,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-03-08 22:05:51,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:51,167 INFO L124 PetriNetUnfolderBase]: 100/1449 cut-off events. [2025-03-08 22:05:51,167 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-03-08 22:05:51,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 1449 events. 100/1449 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8597 event pairs, 12 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 1544. Up to 89 conditions per place. [2025-03-08 22:05:51,177 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 16 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2025-03-08 22:05:51,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 416 transitions, 913 flow [2025-03-08 22:05:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-03-08 22:05:51,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9584214235377027 [2025-03-08 22:05:51,179 INFO L175 Difference]: Start difference. First operand has 411 places, 415 transitions, 872 flow. Second operand 3 states and 1360 transitions. [2025-03-08 22:05:51,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 416 transitions, 913 flow [2025-03-08 22:05:51,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:51,185 INFO L231 Difference]: Finished difference. Result has 408 places, 413 transitions, 872 flow [2025-03-08 22:05:51,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=408, PETRI_TRANSITIONS=413} [2025-03-08 22:05:51,187 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2025-03-08 22:05:51,187 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 413 transitions, 872 flow [2025-03-08 22:05:51,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:51,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:51,188 INFO L206 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] [2025-03-08 22:05:51,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:05:51,188 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:51,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1207810903, now seen corresponding path program 1 times [2025-03-08 22:05:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328613640] [2025-03-08 22:05:51,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:51,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 22:05:51,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 22:05:51,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:51,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:51,221 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-08 22:05:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328613640] [2025-03-08 22:05:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328613640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:51,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:51,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:51,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950448797] [2025-03-08 22:05:51,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:51,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:51,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:51,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:51,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-08 22:05:51,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 413 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:51,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:51,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-08 22:05:51,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:51,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] thread2EXIT-->L102-10: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][279], [Black: 493#true, 485#(= |#race~n2~0| 0), 227#L102-10true, 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), 509#true, Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), 491#(= |#race~count1~0| 0), Black: 505#true, Black: 489#true, 473#(= |#race~n1~0| 0)]) [2025-03-08 22:05:51,311 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2025-03-08 22:05:51,311 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-08 22:05:51,311 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-08 22:05:51,311 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-08 22:05:51,315 INFO L124 PetriNetUnfolderBase]: 61/910 cut-off events. [2025-03-08 22:05:51,315 INFO L125 PetriNetUnfolderBase]: For 19/24 co-relation queries the response was YES. [2025-03-08 22:05:51,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 910 events. 61/910 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4463 event pairs, 6 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 966. Up to 52 conditions per place. [2025-03-08 22:05:51,342 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-08 22:05:51,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 413 transitions, 901 flow [2025-03-08 22:05:51,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-08 22:05:51,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-03-08 22:05:51,345 INFO L175 Difference]: Start difference. First operand has 408 places, 413 transitions, 872 flow. Second operand 3 states and 1362 transitions. [2025-03-08 22:05:51,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 413 transitions, 901 flow [2025-03-08 22:05:51,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 413 transitions, 901 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:51,349 INFO L231 Difference]: Finished difference. Result has 409 places, 412 transitions, 874 flow [2025-03-08 22:05:51,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=409, PETRI_TRANSITIONS=412} [2025-03-08 22:05:51,350 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-03-08 22:05:51,350 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 412 transitions, 874 flow [2025-03-08 22:05:51,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:51,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:51,351 INFO L206 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] [2025-03-08 22:05:51,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:05:51,351 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:51,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:51,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1150572990, now seen corresponding path program 1 times [2025-03-08 22:05:51,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:51,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600411683] [2025-03-08 22:05:51,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:51,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:51,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 22:05:51,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 22:05:51,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:51,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:51,389 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-08 22:05:51,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:51,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600411683] [2025-03-08 22:05:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600411683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:51,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:05:51,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966820749] [2025-03-08 22:05:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:51,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:51,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:51,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:51,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-03-08 22:05:51,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 412 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:51,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:51,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-03-08 22:05:51,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:51,485 INFO L124 PetriNetUnfolderBase]: 81/1037 cut-off events. [2025-03-08 22:05:51,486 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2025-03-08 22:05:51,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1037 events. 81/1037 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5434 event pairs, 12 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1194. Up to 86 conditions per place. [2025-03-08 22:05:51,491 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 11 selfloop transitions, 3 changer transitions 0/414 dead transitions. [2025-03-08 22:05:51,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 414 transitions, 907 flow [2025-03-08 22:05:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2025-03-08 22:05:51,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9640591966173362 [2025-03-08 22:05:51,494 INFO L175 Difference]: Start difference. First operand has 409 places, 412 transitions, 874 flow. Second operand 3 states and 1368 transitions. [2025-03-08 22:05:51,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 414 transitions, 907 flow [2025-03-08 22:05:51,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 414 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:51,500 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 888 flow [2025-03-08 22:05:51,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2025-03-08 22:05:51,500 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2025-03-08 22:05:51,501 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 888 flow [2025-03-08 22:05:51,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:51,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:51,502 INFO L206 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] [2025-03-08 22:05:51,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:05:51,502 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1749233344, now seen corresponding path program 1 times [2025-03-08 22:05:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:51,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860883804] [2025-03-08 22:05:51,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:51,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:51,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 22:05:51,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 22:05:51,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:51,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:51,543 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-08 22:05:51,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:51,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860883804] [2025-03-08 22:05:51,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860883804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:51,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:51,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649700250] [2025-03-08 22:05:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:51,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:51,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:51,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:51,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-08 22:05:51,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:51,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:51,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-08 22:05:51,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:51,682 INFO L124 PetriNetUnfolderBase]: 75/1317 cut-off events. [2025-03-08 22:05:51,682 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2025-03-08 22:05:51,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1317 events. 75/1317 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7254 event pairs, 4 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1471. Up to 36 conditions per place. [2025-03-08 22:05:51,688 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-08 22:05:51,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 413 transitions, 917 flow [2025-03-08 22:05:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-08 22:05:51,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-03-08 22:05:51,691 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 888 flow. Second operand 3 states and 1362 transitions. [2025-03-08 22:05:51,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 413 transitions, 917 flow [2025-03-08 22:05:51,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 413 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:51,700 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 884 flow [2025-03-08 22:05:51,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-03-08 22:05:51,701 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -26 predicate places. [2025-03-08 22:05:51,701 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 884 flow [2025-03-08 22:05:51,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:51,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:51,702 INFO L206 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] [2025-03-08 22:05:51,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:05:51,702 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:51,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash -28159579, now seen corresponding path program 1 times [2025-03-08 22:05:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:51,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424583008] [2025-03-08 22:05:51,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:51,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:51,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:05:51,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:05:51,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:51,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:51,874 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-08 22:05:51,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:51,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424583008] [2025-03-08 22:05:51,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424583008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:51,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:51,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:05:51,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366487585] [2025-03-08 22:05:51,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:51,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:05:51,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:51,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:05:51,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:05:52,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-03-08 22:05:52,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 884 flow. Second operand has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:52,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:52,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-03-08 22:05:52,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:52,425 INFO L124 PetriNetUnfolderBase]: 126/2072 cut-off events. [2025-03-08 22:05:52,425 INFO L125 PetriNetUnfolderBase]: For 10/26 co-relation queries the response was YES. [2025-03-08 22:05:52,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 2072 events. 126/2072 cut-off events. For 10/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14254 event pairs, 17 based on Foata normal form. 6/1858 useless extension candidates. Maximal degree in co-relation 2404. Up to 72 conditions per place. [2025-03-08 22:05:52,433 INFO L140 encePairwiseOnDemand]: 456/473 looper letters, 44 selfloop transitions, 19 changer transitions 0/439 dead transitions. [2025-03-08 22:05:52,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 439 transitions, 1077 flow [2025-03-08 22:05:52,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:05:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 22:05:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5200 transitions. [2025-03-08 22:05:52,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.916138125440451 [2025-03-08 22:05:52,441 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 884 flow. Second operand 12 states and 5200 transitions. [2025-03-08 22:05:52,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 439 transitions, 1077 flow [2025-03-08 22:05:52,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 439 transitions, 1073 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:52,447 INFO L231 Difference]: Finished difference. Result has 425 places, 422 transitions, 981 flow [2025-03-08 22:05:52,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=981, PETRI_PLACES=425, PETRI_TRANSITIONS=422} [2025-03-08 22:05:52,448 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-03-08 22:05:52,448 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 422 transitions, 981 flow [2025-03-08 22:05:52,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:52,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:52,449 INFO L206 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] [2025-03-08 22:05:52,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:05:52,450 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:52,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1273928095, now seen corresponding path program 1 times [2025-03-08 22:05:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:52,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576875880] [2025-03-08 22:05:52,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:52,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:52,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:05:52,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:05:52,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:52,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:52,488 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-08 22:05:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576875880] [2025-03-08 22:05:52,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576875880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:52,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720093375] [2025-03-08 22:05:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:52,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:52,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:52,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:52,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-03-08 22:05:52,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 422 transitions, 981 flow. Second operand has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:52,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:52,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-03-08 22:05:52,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:52,694 INFO L124 PetriNetUnfolderBase]: 147/2144 cut-off events. [2025-03-08 22:05:52,694 INFO L125 PetriNetUnfolderBase]: For 55/59 co-relation queries the response was YES. [2025-03-08 22:05:52,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 2144 events. 147/2144 cut-off events. For 55/59 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14690 event pairs, 12 based on Foata normal form. 0/1947 useless extension candidates. Maximal degree in co-relation 2511. Up to 130 conditions per place. [2025-03-08 22:05:52,706 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 16 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-03-08 22:05:52,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 423 transitions, 1022 flow [2025-03-08 22:05:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-03-08 22:05:52,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9584214235377027 [2025-03-08 22:05:52,709 INFO L175 Difference]: Start difference. First operand has 425 places, 422 transitions, 981 flow. Second operand 3 states and 1360 transitions. [2025-03-08 22:05:52,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 423 transitions, 1022 flow [2025-03-08 22:05:52,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 1022 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:52,716 INFO L231 Difference]: Finished difference. Result has 424 places, 420 transitions, 987 flow [2025-03-08 22:05:52,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=987, PETRI_PLACES=424, PETRI_TRANSITIONS=420} [2025-03-08 22:05:52,717 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2025-03-08 22:05:52,717 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 420 transitions, 987 flow [2025-03-08 22:05:52,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:52,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:52,718 INFO L206 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] [2025-03-08 22:05:52,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:05:52,718 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:52,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 68317135, now seen corresponding path program 1 times [2025-03-08 22:05:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820401018] [2025-03-08 22:05:52,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:52,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:52,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 22:05:52,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 22:05:52,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:52,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:52,767 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-08 22:05:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820401018] [2025-03-08 22:05:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820401018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:52,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:52,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:52,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487363406] [2025-03-08 22:05:52,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:52,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:52,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:52,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:52,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-08 22:05:52,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 420 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:52,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:52,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-08 22:05:52,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:52,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] thread2EXIT-->L102-10: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][264], [Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 546#true, 491#(= |#race~count1~0| 0), Black: 489#true, 548#(= |#race~get2~0| 0), 550#true, 473#(= |#race~n1~0| 0), Black: 493#true, 227#L102-10true, 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 505#true, Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), 520#true, Black: 539#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2025-03-08 22:05:52,923 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-08 22:05:52,924 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-08 22:05:52,924 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-08 22:05:52,924 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-08 22:05:52,928 INFO L124 PetriNetUnfolderBase]: 114/1636 cut-off events. [2025-03-08 22:05:52,928 INFO L125 PetriNetUnfolderBase]: For 56/63 co-relation queries the response was YES. [2025-03-08 22:05:52,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1636 events. 114/1636 cut-off events. For 56/63 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10115 event pairs, 10 based on Foata normal form. 0/1494 useless extension candidates. Maximal degree in co-relation 1952. Up to 96 conditions per place. [2025-03-08 22:05:52,938 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2025-03-08 22:05:52,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1016 flow [2025-03-08 22:05:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-08 22:05:52,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-03-08 22:05:52,941 INFO L175 Difference]: Start difference. First operand has 424 places, 420 transitions, 987 flow. Second operand 3 states and 1362 transitions. [2025-03-08 22:05:52,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1016 flow [2025-03-08 22:05:52,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1016 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:52,947 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 989 flow [2025-03-08 22:05:52,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2025-03-08 22:05:52,947 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-03-08 22:05:52,948 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 989 flow [2025-03-08 22:05:52,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:52,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:52,948 INFO L206 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] [2025-03-08 22:05:52,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:05:52,948 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:52,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash -596954393, now seen corresponding path program 1 times [2025-03-08 22:05:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:52,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060637101] [2025-03-08 22:05:52,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:52,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 22:05:52,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 22:05:52,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:52,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:53,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-08 22:05:53,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:53,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060637101] [2025-03-08 22:05:53,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060637101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:53,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:53,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:05:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513048400] [2025-03-08 22:05:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:53,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:05:53,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:53,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:05:53,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:05:53,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-03-08 22:05:53,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 989 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:53,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:53,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-03-08 22:05:53,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:53,623 INFO L124 PetriNetUnfolderBase]: 123/1434 cut-off events. [2025-03-08 22:05:53,623 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2025-03-08 22:05:53,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1434 events. 123/1434 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8371 event pairs, 22 based on Foata normal form. 0/1311 useless extension candidates. Maximal degree in co-relation 1838. Up to 159 conditions per place. [2025-03-08 22:05:53,631 INFO L140 encePairwiseOnDemand]: 457/473 looper letters, 48 selfloop transitions, 17 changer transitions 0/443 dead transitions. [2025-03-08 22:05:53,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 443 transitions, 1181 flow [2025-03-08 22:05:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:05:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:05:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4772 transitions. [2025-03-08 22:05:53,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171631750912935 [2025-03-08 22:05:53,638 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 989 flow. Second operand 11 states and 4772 transitions. [2025-03-08 22:05:53,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 443 transitions, 1181 flow [2025-03-08 22:05:53,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 443 transitions, 1177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:53,644 INFO L231 Difference]: Finished difference. Result has 436 places, 424 transitions, 1058 flow [2025-03-08 22:05:53,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1058, PETRI_PLACES=436, PETRI_TRANSITIONS=424} [2025-03-08 22:05:53,645 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 0 predicate places. [2025-03-08 22:05:53,645 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 424 transitions, 1058 flow [2025-03-08 22:05:53,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:53,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:53,646 INFO L206 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] [2025-03-08 22:05:53,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:05:53,646 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:53,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1831361245, now seen corresponding path program 1 times [2025-03-08 22:05:53,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131326022] [2025-03-08 22:05:53,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:53,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:53,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 22:05:53,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 22:05:53,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:53,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:05:53,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:53,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131326022] [2025-03-08 22:05:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131326022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:53,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:53,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:05:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225140817] [2025-03-08 22:05:53,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:53,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:05:53,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:53,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:05:53,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:05:54,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-03-08 22:05:54,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 424 transitions, 1058 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:54,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:54,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-03-08 22:05:54,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:54,429 INFO L124 PetriNetUnfolderBase]: 189/2781 cut-off events. [2025-03-08 22:05:54,430 INFO L125 PetriNetUnfolderBase]: For 206/235 co-relation queries the response was YES. [2025-03-08 22:05:54,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3686 conditions, 2781 events. 189/2781 cut-off events. For 206/235 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20666 event pairs, 28 based on Foata normal form. 8/2596 useless extension candidates. Maximal degree in co-relation 3607. Up to 129 conditions per place. [2025-03-08 22:05:54,446 INFO L140 encePairwiseOnDemand]: 457/473 looper letters, 50 selfloop transitions, 21 changer transitions 0/449 dead transitions. [2025-03-08 22:05:54,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 449 transitions, 1303 flow [2025-03-08 22:05:54,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:05:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:05:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4763 transitions. [2025-03-08 22:05:54,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9154334038054969 [2025-03-08 22:05:54,453 INFO L175 Difference]: Start difference. First operand has 436 places, 424 transitions, 1058 flow. Second operand 11 states and 4763 transitions. [2025-03-08 22:05:54,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 449 transitions, 1303 flow [2025-03-08 22:05:54,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 449 transitions, 1282 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 22:05:54,461 INFO L231 Difference]: Finished difference. Result has 444 places, 438 transitions, 1191 flow [2025-03-08 22:05:54,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1191, PETRI_PLACES=444, PETRI_TRANSITIONS=438} [2025-03-08 22:05:54,461 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 8 predicate places. [2025-03-08 22:05:54,462 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 438 transitions, 1191 flow [2025-03-08 22:05:54,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:54,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:54,463 INFO L206 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] [2025-03-08 22:05:54,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:05:54,463 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:54,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -46960097, now seen corresponding path program 1 times [2025-03-08 22:05:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:54,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253481299] [2025-03-08 22:05:54,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:54,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:54,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 22:05:54,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 22:05:54,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:54,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:05:54,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253481299] [2025-03-08 22:05:54,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253481299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:54,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:54,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:05:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658162173] [2025-03-08 22:05:54,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:54,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:05:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:54,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:05:54,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:05:54,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-03-08 22:05:54,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 438 transitions, 1191 flow. Second operand has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:54,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:54,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-03-08 22:05:54,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:55,041 INFO L124 PetriNetUnfolderBase]: 162/1951 cut-off events. [2025-03-08 22:05:55,041 INFO L125 PetriNetUnfolderBase]: For 294/299 co-relation queries the response was YES. [2025-03-08 22:05:55,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1951 events. 162/1951 cut-off events. For 294/299 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12698 event pairs, 25 based on Foata normal form. 8/1815 useless extension candidates. Maximal degree in co-relation 2695. Up to 164 conditions per place. [2025-03-08 22:05:55,053 INFO L140 encePairwiseOnDemand]: 456/473 looper letters, 44 selfloop transitions, 24 changer transitions 0/455 dead transitions. [2025-03-08 22:05:55,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 455 transitions, 1402 flow [2025-03-08 22:05:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:05:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 22:05:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5191 transitions. [2025-03-08 22:05:55,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145525017618041 [2025-03-08 22:05:55,059 INFO L175 Difference]: Start difference. First operand has 444 places, 438 transitions, 1191 flow. Second operand 12 states and 5191 transitions. [2025-03-08 22:05:55,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 455 transitions, 1402 flow [2025-03-08 22:05:55,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 455 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:55,067 INFO L231 Difference]: Finished difference. Result has 458 places, 447 transitions, 1327 flow [2025-03-08 22:05:55,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1327, PETRI_PLACES=458, PETRI_TRANSITIONS=447} [2025-03-08 22:05:55,068 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 22 predicate places. [2025-03-08 22:05:55,068 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 447 transitions, 1327 flow [2025-03-08 22:05:55,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:55,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:55,069 INFO L206 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-08 22:05:55,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:05:55,069 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:55,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1815725443, now seen corresponding path program 1 times [2025-03-08 22:05:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676346126] [2025-03-08 22:05:55,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:55,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 22:05:55,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 22:05:55,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:55,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:55,102 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-08 22:05:55,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676346126] [2025-03-08 22:05:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676346126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:55,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:05:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937359880] [2025-03-08 22:05:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:55,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:55,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:55,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:55,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-03-08 22:05:55,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 447 transitions, 1327 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:55,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:55,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-03-08 22:05:55,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:55,369 INFO L124 PetriNetUnfolderBase]: 145/2656 cut-off events. [2025-03-08 22:05:55,369 INFO L125 PetriNetUnfolderBase]: For 496/503 co-relation queries the response was YES. [2025-03-08 22:05:55,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 2656 events. 145/2656 cut-off events. For 496/503 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19465 event pairs, 17 based on Foata normal form. 1/2463 useless extension candidates. Maximal degree in co-relation 3556. Up to 77 conditions per place. [2025-03-08 22:05:55,383 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 15 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2025-03-08 22:05:55,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 452 transitions, 1374 flow [2025-03-08 22:05:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2025-03-08 22:05:55,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966878083157153 [2025-03-08 22:05:55,385 INFO L175 Difference]: Start difference. First operand has 458 places, 447 transitions, 1327 flow. Second operand 3 states and 1372 transitions. [2025-03-08 22:05:55,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 452 transitions, 1374 flow [2025-03-08 22:05:55,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 452 transitions, 1357 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:05:55,393 INFO L231 Difference]: Finished difference. Result has 456 places, 449 transitions, 1330 flow [2025-03-08 22:05:55,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=456, PETRI_TRANSITIONS=449} [2025-03-08 22:05:55,394 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 20 predicate places. [2025-03-08 22:05:55,394 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 449 transitions, 1330 flow [2025-03-08 22:05:55,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:55,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:55,395 INFO L206 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-08 22:05:55,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:05:55,395 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:55,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash -753244587, now seen corresponding path program 2 times [2025-03-08 22:05:55,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:55,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316161894] [2025-03-08 22:05:55,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:05:55,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:55,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 1 equivalence classes. [2025-03-08 22:05:55,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 22:05:55,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:05:55,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:55,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:55,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316161894] [2025-03-08 22:05:55,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316161894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:55,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:55,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:05:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954151946] [2025-03-08 22:05:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:55,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:55,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:55,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:55,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:55,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-03-08 22:05:55,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 449 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:55,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:55,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-03-08 22:05:55,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:55,649 INFO L124 PetriNetUnfolderBase]: 139/2631 cut-off events. [2025-03-08 22:05:55,649 INFO L125 PetriNetUnfolderBase]: For 669/689 co-relation queries the response was YES. [2025-03-08 22:05:55,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3771 conditions, 2631 events. 139/2631 cut-off events. For 669/689 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 19168 event pairs, 13 based on Foata normal form. 13/2478 useless extension candidates. Maximal degree in co-relation 3675. Up to 72 conditions per place. [2025-03-08 22:05:55,661 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 17 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2025-03-08 22:05:55,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 454 transitions, 1385 flow [2025-03-08 22:05:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2025-03-08 22:05:55,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966878083157153 [2025-03-08 22:05:55,663 INFO L175 Difference]: Start difference. First operand has 456 places, 449 transitions, 1330 flow. Second operand 3 states and 1372 transitions. [2025-03-08 22:05:55,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 454 transitions, 1385 flow [2025-03-08 22:05:55,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 454 transitions, 1383 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:55,671 INFO L231 Difference]: Finished difference. Result has 459 places, 451 transitions, 1352 flow [2025-03-08 22:05:55,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1352, PETRI_PLACES=459, PETRI_TRANSITIONS=451} [2025-03-08 22:05:55,672 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 23 predicate places. [2025-03-08 22:05:55,672 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 451 transitions, 1352 flow [2025-03-08 22:05:55,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:55,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:55,673 INFO L206 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-08 22:05:55,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:05:55,673 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:55,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:55,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1726207523, now seen corresponding path program 1 times [2025-03-08 22:05:55,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:55,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878642128] [2025-03-08 22:05:55,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:55,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:55,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 22:05:55,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 22:05:55,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:55,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:55,704 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-08 22:05:55,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:55,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878642128] [2025-03-08 22:05:55,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878642128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:55,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:55,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:55,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501081686] [2025-03-08 22:05:55,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:55,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:55,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:55,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:55,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:55,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-03-08 22:05:55,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 451 transitions, 1352 flow. Second operand has 3 states, 3 states have (on average 449.0) internal successors, (1347), 3 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:55,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:55,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-03-08 22:05:55,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:55,931 INFO L124 PetriNetUnfolderBase]: 126/2491 cut-off events. [2025-03-08 22:05:55,932 INFO L125 PetriNetUnfolderBase]: For 548/590 co-relation queries the response was YES. [2025-03-08 22:05:55,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3616 conditions, 2491 events. 126/2491 cut-off events. For 548/590 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 17832 event pairs, 10 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 3523. Up to 74 conditions per place. [2025-03-08 22:05:55,942 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 12 selfloop transitions, 1 changer transitions 0/448 dead transitions. [2025-03-08 22:05:55,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 448 transitions, 1372 flow [2025-03-08 22:05:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-03-08 22:05:55,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95630725863284 [2025-03-08 22:05:55,944 INFO L175 Difference]: Start difference. First operand has 459 places, 451 transitions, 1352 flow. Second operand 3 states and 1357 transitions. [2025-03-08 22:05:55,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 448 transitions, 1372 flow [2025-03-08 22:05:55,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 448 transitions, 1366 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:55,953 INFO L231 Difference]: Finished difference. Result has 457 places, 448 transitions, 1342 flow [2025-03-08 22:05:55,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1342, PETRI_PLACES=457, PETRI_TRANSITIONS=448} [2025-03-08 22:05:55,954 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 21 predicate places. [2025-03-08 22:05:55,954 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 448 transitions, 1342 flow [2025-03-08 22:05:55,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.0) internal successors, (1347), 3 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:55,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:55,956 INFO L206 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] [2025-03-08 22:05:55,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:05:55,956 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:55,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash -724322148, now seen corresponding path program 1 times [2025-03-08 22:05:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:55,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53304178] [2025-03-08 22:05:55,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:55,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 22:05:55,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 22:05:55,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:55,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:55,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-08 22:05:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53304178] [2025-03-08 22:05:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53304178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941701867] [2025-03-08 22:05:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:55,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:55,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:56,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-03-08 22:05:56,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 448 transitions, 1342 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:56,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:56,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-03-08 22:05:56,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:56,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] thread2EXIT-->L102-10: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][271], [Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), 491#(= |#race~count1~0| 0), 473#(= |#race~n1~0| 0), Black: 582#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 638#true, Black: 587#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), Black: 581#(<= ~n2~0 0), Black: 595#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 601#true, Black: 589#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), Black: 539#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 632#(= ~count2~0 ~count1~0), 485#(= |#race~n2~0| 0), Black: 546#true, Black: 489#true, Black: 620#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 548#(= |#race~get2~0| 0), Black: 606#(<= ~n2~0 0), Black: 607#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 493#true, 227#L102-10true, Black: 627#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 630#true, Black: 505#true, Black: 572#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 635#true, Black: 558#(<= ~n1~0 0), Black: 559#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 520#true]) [2025-03-08 22:05:56,207 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-08 22:05:56,207 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-03-08 22:05:56,208 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-08 22:05:56,208 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-08 22:05:56,211 INFO L124 PetriNetUnfolderBase]: 128/2358 cut-off events. [2025-03-08 22:05:56,211 INFO L125 PetriNetUnfolderBase]: For 421/447 co-relation queries the response was YES. [2025-03-08 22:05:56,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 2358 events. 128/2358 cut-off events. For 421/447 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 16492 event pairs, 10 based on Foata normal form. 9/2240 useless extension candidates. Maximal degree in co-relation 3266. Up to 99 conditions per place. [2025-03-08 22:05:56,218 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 6 selfloop transitions, 0 changer transitions 86/447 dead transitions. [2025-03-08 22:05:56,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 447 transitions, 1368 flow [2025-03-08 22:05:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-08 22:05:56,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-08 22:05:56,219 INFO L175 Difference]: Start difference. First operand has 457 places, 448 transitions, 1342 flow. Second operand 3 states and 1358 transitions. [2025-03-08 22:05:56,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 447 transitions, 1368 flow [2025-03-08 22:05:56,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 447 transitions, 1367 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:56,226 INFO L231 Difference]: Finished difference. Result has 455 places, 361 transitions, 932 flow [2025-03-08 22:05:56,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=932, PETRI_PLACES=455, PETRI_TRANSITIONS=361} [2025-03-08 22:05:56,226 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 19 predicate places. [2025-03-08 22:05:56,227 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 361 transitions, 932 flow [2025-03-08 22:05:56,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:56,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:56,227 INFO L206 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] [2025-03-08 22:05:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:05:56,227 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:56,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:56,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1826257537, now seen corresponding path program 1 times [2025-03-08 22:05:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975468440] [2025-03-08 22:05:56,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:56,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 22:05:56,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 22:05:56,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:56,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:05:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975468440] [2025-03-08 22:05:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975468440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840402735] [2025-03-08 22:05:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:56,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:56,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:56,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:56,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-03-08 22:05:56,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 361 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:56,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:56,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-03-08 22:05:56,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:57,010 INFO L124 PetriNetUnfolderBase]: 85/1368 cut-off events. [2025-03-08 22:05:57,010 INFO L125 PetriNetUnfolderBase]: For 209/210 co-relation queries the response was YES. [2025-03-08 22:05:57,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 1368 events. 85/1368 cut-off events. For 209/210 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8413 event pairs, 4 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 1958. Up to 43 conditions per place. [2025-03-08 22:05:57,018 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/364 dead transitions. [2025-03-08 22:05:57,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 364 transitions, 1008 flow [2025-03-08 22:05:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-03-08 22:05:57,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-03-08 22:05:57,020 INFO L175 Difference]: Start difference. First operand has 455 places, 361 transitions, 932 flow. Second operand 6 states and 2637 transitions. [2025-03-08 22:05:57,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 364 transitions, 1008 flow [2025-03-08 22:05:57,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 364 transitions, 908 flow, removed 24 selfloop flow, removed 26 redundant places. [2025-03-08 22:05:57,025 INFO L231 Difference]: Finished difference. Result has 374 places, 360 transitions, 851 flow [2025-03-08 22:05:57,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=851, PETRI_PLACES=374, PETRI_TRANSITIONS=360} [2025-03-08 22:05:57,026 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2025-03-08 22:05:57,026 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 360 transitions, 851 flow [2025-03-08 22:05:57,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:57,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:57,026 INFO L206 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] [2025-03-08 22:05:57,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:05:57,030 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:57,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1274001725, now seen corresponding path program 1 times [2025-03-08 22:05:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:57,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331367917] [2025-03-08 22:05:57,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:57,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 22:05:57,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 22:05:57,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:57,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:05:57,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:57,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331367917] [2025-03-08 22:05:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331367917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:57,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:57,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:57,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084749358] [2025-03-08 22:05:57,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:57,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:57,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:57,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:57,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:57,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-03-08 22:05:57,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 360 transitions, 851 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:57,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:57,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-03-08 22:05:57,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:57,850 INFO L124 PetriNetUnfolderBase]: 89/1146 cut-off events. [2025-03-08 22:05:57,850 INFO L125 PetriNetUnfolderBase]: For 68/71 co-relation queries the response was YES. [2025-03-08 22:05:57,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 1146 events. 89/1146 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6510 event pairs, 5 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 1516. Up to 66 conditions per place. [2025-03-08 22:05:57,857 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/363 dead transitions. [2025-03-08 22:05:57,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 363 transitions, 923 flow [2025-03-08 22:05:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-03-08 22:05:57,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-03-08 22:05:57,861 INFO L175 Difference]: Start difference. First operand has 374 places, 360 transitions, 851 flow. Second operand 6 states and 2637 transitions. [2025-03-08 22:05:57,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 363 transitions, 923 flow [2025-03-08 22:05:57,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 363 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:05:57,867 INFO L231 Difference]: Finished difference. Result has 374 places, 359 transitions, 857 flow [2025-03-08 22:05:57,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=857, PETRI_PLACES=374, PETRI_TRANSITIONS=359} [2025-03-08 22:05:57,869 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2025-03-08 22:05:57,869 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 359 transitions, 857 flow [2025-03-08 22:05:57,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:57,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:57,871 INFO L206 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] [2025-03-08 22:05:57,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:05:57,871 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:57,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1809978341, now seen corresponding path program 1 times [2025-03-08 22:05:57,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:57,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192730160] [2025-03-08 22:05:57,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:57,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 22:05:57,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 22:05:57,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:57,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:05:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:58,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192730160] [2025-03-08 22:05:58,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192730160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:58,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815437365] [2025-03-08 22:05:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:58,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:58,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:58,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:58,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-03-08 22:05:58,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 359 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:58,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:58,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-03-08 22:05:58,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:58,615 INFO L124 PetriNetUnfolderBase]: 79/1333 cut-off events. [2025-03-08 22:05:58,615 INFO L125 PetriNetUnfolderBase]: For 52/53 co-relation queries the response was YES. [2025-03-08 22:05:58,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1333 events. 79/1333 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8006 event pairs, 4 based on Foata normal form. 0/1273 useless extension candidates. Maximal degree in co-relation 1740. Up to 42 conditions per place. [2025-03-08 22:05:58,620 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/361 dead transitions. [2025-03-08 22:05:58,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 361 transitions, 927 flow [2025-03-08 22:05:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-03-08 22:05:58,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-03-08 22:05:58,622 INFO L175 Difference]: Start difference. First operand has 374 places, 359 transitions, 857 flow. Second operand 6 states and 2637 transitions. [2025-03-08 22:05:58,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 361 transitions, 927 flow [2025-03-08 22:05:58,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 361 transitions, 918 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:05:58,626 INFO L231 Difference]: Finished difference. Result has 373 places, 357 transitions, 856 flow [2025-03-08 22:05:58,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=373, PETRI_TRANSITIONS=357} [2025-03-08 22:05:58,627 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -63 predicate places. [2025-03-08 22:05:58,627 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 357 transitions, 856 flow [2025-03-08 22:05:58,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:58,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:58,628 INFO L206 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] [2025-03-08 22:05:58,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:05:58,628 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:58,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1802929831, now seen corresponding path program 1 times [2025-03-08 22:05:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483171215] [2025-03-08 22:05:58,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:58,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:58,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 22:05:58,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 22:05:58,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:58,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:05:58,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:58,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483171215] [2025-03-08 22:05:58,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483171215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:58,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:58,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:58,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053662536] [2025-03-08 22:05:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:58,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:58,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:58,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:58,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:59,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-03-08 22:05:59,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 357 transitions, 856 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:59,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:59,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-03-08 22:05:59,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:59,327 INFO L124 PetriNetUnfolderBase]: 84/1120 cut-off events. [2025-03-08 22:05:59,327 INFO L125 PetriNetUnfolderBase]: For 90/93 co-relation queries the response was YES. [2025-03-08 22:05:59,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 1120 events. 84/1120 cut-off events. For 90/93 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6165 event pairs, 5 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1496. Up to 61 conditions per place. [2025-03-08 22:05:59,332 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/359 dead transitions. [2025-03-08 22:05:59,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 359 transitions, 926 flow [2025-03-08 22:05:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-03-08 22:05:59,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-03-08 22:05:59,334 INFO L175 Difference]: Start difference. First operand has 373 places, 357 transitions, 856 flow. Second operand 6 states and 2637 transitions. [2025-03-08 22:05:59,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 359 transitions, 926 flow [2025-03-08 22:05:59,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 359 transitions, 914 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:59,338 INFO L231 Difference]: Finished difference. Result has 371 places, 355 transitions, 852 flow [2025-03-08 22:05:59,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=852, PETRI_PLACES=371, PETRI_TRANSITIONS=355} [2025-03-08 22:05:59,338 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -65 predicate places. [2025-03-08 22:05:59,338 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 355 transitions, 852 flow [2025-03-08 22:05:59,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:59,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:59,339 INFO L206 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] [2025-03-08 22:05:59,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:05:59,339 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:59,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:59,340 INFO L85 PathProgramCache]: Analyzing trace with hash 720081319, now seen corresponding path program 1 times [2025-03-08 22:05:59,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:59,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650804707] [2025-03-08 22:05:59,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:59,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 22:05:59,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 22:05:59,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:59,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:05:59,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:59,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650804707] [2025-03-08 22:05:59,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650804707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:59,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:59,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:59,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311625321] [2025-03-08 22:05:59,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:59,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:59,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:59,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:59,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-08 22:05:59,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 355 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:59,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:59,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-08 22:05:59,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:59,486 INFO L124 PetriNetUnfolderBase]: 66/1173 cut-off events. [2025-03-08 22:05:59,486 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-03-08 22:05:59,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 1173 events. 66/1173 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6328 event pairs, 4 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1485. Up to 36 conditions per place. [2025-03-08 22:05:59,492 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 7 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-03-08 22:05:59,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 355 transitions, 871 flow [2025-03-08 22:05:59,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-03-08 22:05:59,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95630725863284 [2025-03-08 22:05:59,493 INFO L175 Difference]: Start difference. First operand has 371 places, 355 transitions, 852 flow. Second operand 3 states and 1357 transitions. [2025-03-08 22:05:59,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 355 transitions, 871 flow [2025-03-08 22:05:59,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 355 transitions, 859 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:59,497 INFO L231 Difference]: Finished difference. Result has 367 places, 354 transitions, 842 flow [2025-03-08 22:05:59,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=367, PETRI_TRANSITIONS=354} [2025-03-08 22:05:59,498 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -69 predicate places. [2025-03-08 22:05:59,498 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 354 transitions, 842 flow [2025-03-08 22:05:59,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:59,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:59,498 INFO L206 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] [2025-03-08 22:05:59,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:05:59,499 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-08 22:05:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1012247990, now seen corresponding path program 1 times [2025-03-08 22:05:59,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:59,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393192105] [2025-03-08 22:05:59,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:59,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:59,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 22:05:59,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 22:05:59,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:59,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:05:59,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:59,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393192105] [2025-03-08 22:05:59,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393192105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:59,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:59,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171938097] [2025-03-08 22:05:59,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:59,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:59,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:59,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:59,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-03-08 22:05:59,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 354 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:59,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:59,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-03-08 22:05:59,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:59,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1114] L77-2-->L77: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_3|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_3|} AuxVars[] AssignedVars[#race~res2~0][263], [Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 646#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 491#(= |#race~count1~0| 0), Black: 653#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 473#(= |#race~n1~0| 0), 158#L100true, 638#true, Black: 587#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), 601#true, 632#(= ~count2~0 ~count1~0), Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 546#true, Black: 489#true, 548#(= |#race~get2~0| 0), 10#L77true, Black: 493#true, 667#true, Black: 627#(not (= ~count2~0 ~count1~0)), 670#true, 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 630#true, Black: 505#true, 520#true]) [2025-03-08 22:05:59,632 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-08 22:05:59,632 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-08 22:05:59,632 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-08 22:05:59,632 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-08 22:05:59,632 INFO L124 PetriNetUnfolderBase]: 65/1014 cut-off events. [2025-03-08 22:05:59,633 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2025-03-08 22:05:59,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1014 events. 65/1014 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4957 event pairs, 4 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1275. Up to 44 conditions per place. [2025-03-08 22:05:59,637 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2025-03-08 22:05:59,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 354 transitions, 863 flow [2025-03-08 22:05:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-03-08 22:05:59,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-03-08 22:05:59,638 INFO L175 Difference]: Start difference. First operand has 367 places, 354 transitions, 842 flow. Second operand 3 states and 1358 transitions. [2025-03-08 22:05:59,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 354 transitions, 863 flow [2025-03-08 22:05:59,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 354 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:59,641 INFO L231 Difference]: Finished difference. Result has 366 places, 0 transitions, 0 flow [2025-03-08 22:05:59,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=366, PETRI_TRANSITIONS=0} [2025-03-08 22:05:59,642 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -70 predicate places. [2025-03-08 22:05:59,642 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 0 transitions, 0 flow [2025-03-08 22:05:59,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:59,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2025-03-08 22:05:59,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2025-03-08 22:05:59,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2025-03-08 22:05:59,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2025-03-08 22:05:59,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2025-03-08 22:05:59,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2025-03-08 22:05:59,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2025-03-08 22:05:59,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2025-03-08 22:05:59,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2025-03-08 22:05:59,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2025-03-08 22:05:59,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2025-03-08 22:05:59,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2025-03-08 22:05:59,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:05:59,651 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:59,656 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:05:59,656 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:05:59,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:05:59 BasicIcfg [2025-03-08 22:05:59,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:05:59,660 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:05:59,660 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:05:59,660 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:05:59,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:47" (3/4) ... [2025-03-08 22:05:59,663 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:05:59,665 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:05:59,665 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:05:59,671 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-08 22:05:59,673 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:05:59,673 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:05:59,673 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:05:59,740 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:05:59,740 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:05:59,740 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:05:59,742 INFO L158 Benchmark]: Toolchain (without parser) took 13241.44ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 113.2MB in the beginning and 206.9MB in the end (delta: -93.7MB). Peak memory consumption was 286.6MB. Max. memory is 16.1GB. [2025-03-08 22:05:59,742 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:05:59,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.03ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.8MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:05:59,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.86ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:05:59,745 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:05:59,745 INFO L158 Benchmark]: IcfgBuilder took 565.51ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 61.0MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 22:05:59,745 INFO L158 Benchmark]: TraceAbstraction took 12290.91ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 60.5MB in the beginning and 215.3MB in the end (delta: -154.8MB). Peak memory consumption was 227.8MB. Max. memory is 16.1GB. [2025-03-08 22:05:59,745 INFO L158 Benchmark]: Witness Printer took 80.47ms. Allocated memory is still 528.5MB. Free memory was 215.3MB in the beginning and 206.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:05:59,746 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.03ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.8MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.86ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 565.51ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 61.0MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12290.91ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 60.5MB in the beginning and 215.3MB in the end (delta: -154.8MB). Peak memory consumption was 227.8MB. Max. memory is 16.1GB. * Witness Printer took 80.47ms. Allocated memory is still 528.5MB. Free memory was 215.3MB in the beginning and 206.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: 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, 668 locations, 703 edges, 94 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: 12.1s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3926 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2410 mSDsluCounter, 3823 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3492 mSDsCounter, 629 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5505 IncrementalHoareTripleChecker+Invalid, 6134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 629 mSolverCounterUnsat, 331 mSDtfsCounter, 5505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1352occurred in iteration=25, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 4436 NumberOfCodeBlocks, 4436 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4403 ConstructedInterpolants, 0 QuantifiedInterpolants, 5761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 14/14 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 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:05:59,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE