./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.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-node-subst.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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:04:57,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:04:57,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:04:57,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:04:57,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:04:57,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:04:57,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:04:57,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:04:57,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:04:57,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:04:57,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:04:57,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:04:57,148 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:04:57,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:04:57,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:04:57,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:04:57,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:04:57,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:04:57,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:04:57,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:04:57,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:57,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:04:57,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:04:57,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:04:57,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:04:57,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:04:57,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:04:57,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:04:57,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:04:57,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:04:57,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:04:57,151 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-03-08 22:04:57,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:04:57,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:04:57,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:04:57,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:04:57,404 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:04:57,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-08 22:04:58,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d76c151/c8454b21e7f142fc8ed19becf57fac3b/FLAG744dbad3e [2025-03-08 22:04:58,781 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:04:58,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-08 22:04:58,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d76c151/c8454b21e7f142fc8ed19becf57fac3b/FLAG744dbad3e [2025-03-08 22:04:59,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d76c151/c8454b21e7f142fc8ed19becf57fac3b [2025-03-08 22:04:59,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:04:59,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:04:59,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:59,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:04:59,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:04:59,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d81cd6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59, skipping insertion in model container [2025-03-08 22:04:59,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:04:59,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:59,275 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:04:59,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:59,327 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:04:59,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59 WrapperNode [2025-03-08 22:04:59,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:59,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:59,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:04:59,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:04:59,334 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:04:59" (1/1) ... [2025-03-08 22:04:59,342 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:04:59" (1/1) ... [2025-03-08 22:04:59,385 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 779 [2025-03-08 22:04:59,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:59,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:04:59,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:04:59,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:04:59,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:04:59,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:04:59,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:04:59,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:04:59,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (1/1) ... [2025-03-08 22:04:59,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:59,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:59,472 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:04:59,477 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:04:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:04:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:04:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:04:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:04:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:04:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:04:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:04:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:04:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:04:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:04:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:04:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:04:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:04:59,495 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:04:59,597 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:04:59,599 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:05:00,372 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:05:00,372 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:05:00,401 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:05:00,402 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:05:00,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:00 BoogieIcfgContainer [2025-03-08 22:05:00,402 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:05:00,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:05:00,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:05:00,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:05:00,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:04:59" (1/3) ... [2025-03-08 22:05:00,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adef425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:05:00, skipping insertion in model container [2025-03-08 22:05:00,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:59" (2/3) ... [2025-03-08 22:05:00,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adef425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:05:00, skipping insertion in model container [2025-03-08 22:05:00,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:00" (3/3) ... [2025-03-08 22:05:00,427 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-03-08 22:05:00,437 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:05:00,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 1007 locations, 1 initial locations, 6 loop locations, and 116 error locations. [2025-03-08 22:05:00,438 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:05:00,553 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:05:00,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1016 places, 1048 transitions, 2117 flow [2025-03-08 22:05:00,859 INFO L124 PetriNetUnfolderBase]: 42/1045 cut-off events. [2025-03-08 22:05:00,861 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:05:00,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 1045 events. 42/1045 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2265 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-08 22:05:00,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 1016 places, 1048 transitions, 2117 flow [2025-03-08 22:05:00,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 993 places, 1022 transitions, 2062 flow [2025-03-08 22:05:00,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:05:00,918 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;@10738827, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:05:00,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 194 error locations. [2025-03-08 22:05:00,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:05:00,925 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-08 22:05:00,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:05:00,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:00,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] [2025-03-08 22:05:00,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:00,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1810093037, now seen corresponding path program 1 times [2025-03-08 22:05:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412070791] [2025-03-08 22:05:00,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:00,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:05:01,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:05:01,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:01,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:01,085 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:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412070791] [2025-03-08 22:05:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412070791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:01,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:01,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:01,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321473017] [2025-03-08 22:05:01,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:01,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:01,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:01,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:01,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2025-03-08 22:05:01,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 1022 transitions, 2062 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states 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:01,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:01,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2025-03-08 22:05:01,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:01,732 INFO L124 PetriNetUnfolderBase]: 86/2508 cut-off events. [2025-03-08 22:05:01,733 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-08 22:05:01,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2508 events. 86/2508 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14467 event pairs, 39 based on Foata normal form. 62/2119 useless extension candidates. Maximal degree in co-relation 1937. Up to 89 conditions per place. [2025-03-08 22:05:01,781 INFO L140 encePairwiseOnDemand]: 1023/1048 looper letters, 19 selfloop transitions, 2 changer transitions 16/999 dead transitions. [2025-03-08 22:05:01,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 999 transitions, 2058 flow [2025-03-08 22:05:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3047 transitions. [2025-03-08 22:05:01,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969147582697201 [2025-03-08 22:05:01,809 INFO L175 Difference]: Start difference. First operand has 993 places, 1022 transitions, 2062 flow. Second operand 3 states and 3047 transitions. [2025-03-08 22:05:01,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 999 transitions, 2058 flow [2025-03-08 22:05:01,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 999 transitions, 2046 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:05:01,833 INFO L231 Difference]: Finished difference. Result has 988 places, 983 transitions, 1976 flow [2025-03-08 22:05:01,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1976, PETRI_PLACES=988, PETRI_TRANSITIONS=983} [2025-03-08 22:05:01,841 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -5 predicate places. [2025-03-08 22:05:01,841 INFO L471 AbstractCegarLoop]: Abstraction has has 988 places, 983 transitions, 1976 flow [2025-03-08 22:05:01,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states 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:01,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:01,843 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] [2025-03-08 22:05:01,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:05:01,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:01,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1772810165, now seen corresponding path program 1 times [2025-03-08 22:05:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830230889] [2025-03-08 22:05:01,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:01,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:05:01,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:05:01,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:01,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:01,904 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:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830230889] [2025-03-08 22:05:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830230889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030817881] [2025-03-08 22:05:01,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:01,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:01,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:01,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:01,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:01,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1048 [2025-03-08 22:05:01,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 983 transitions, 1976 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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:01,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:01,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1048 [2025-03-08 22:05:01,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:02,662 INFO L124 PetriNetUnfolderBase]: 212/3960 cut-off events. [2025-03-08 22:05:02,662 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-08 22:05:02,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4280 conditions, 3960 events. 212/3960 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 29703 event pairs, 132 based on Foata normal form. 0/3320 useless extension candidates. Maximal degree in co-relation 4237. Up to 257 conditions per place. [2025-03-08 22:05:02,721 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/973 dead transitions. [2025-03-08 22:05:02,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 973 transitions, 2010 flow [2025-03-08 22:05:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2025-03-08 22:05:02,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535623409669212 [2025-03-08 22:05:02,730 INFO L175 Difference]: Start difference. First operand has 988 places, 983 transitions, 1976 flow. Second operand 3 states and 2998 transitions. [2025-03-08 22:05:02,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 964 places, 973 transitions, 2010 flow [2025-03-08 22:05:02,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 973 transitions, 2006 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:02,770 INFO L231 Difference]: Finished difference. Result has 962 places, 973 transitions, 1954 flow [2025-03-08 22:05:02,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1952, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1954, PETRI_PLACES=962, PETRI_TRANSITIONS=973} [2025-03-08 22:05:02,772 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -31 predicate places. [2025-03-08 22:05:02,772 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 973 transitions, 1954 flow [2025-03-08 22:05:02,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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:02,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:02,773 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] [2025-03-08 22:05:02,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:05:02,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:02,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:02,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1544170900, now seen corresponding path program 1 times [2025-03-08 22:05:02,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:02,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038094534] [2025-03-08 22:05:02,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:02,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:05:02,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:05:02,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:02,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:02,835 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:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038094534] [2025-03-08 22:05:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038094534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619688156] [2025-03-08 22:05:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:02,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:02,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:02,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:02,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2025-03-08 22:05:02,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 973 transitions, 1954 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states 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:02,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:02,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2025-03-08 22:05:02,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:03,363 INFO L124 PetriNetUnfolderBase]: 62/2211 cut-off events. [2025-03-08 22:05:03,363 INFO L125 PetriNetUnfolderBase]: For 9/16 co-relation queries the response was YES. [2025-03-08 22:05:03,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 2211 events. 62/2211 cut-off events. For 9/16 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11182 event pairs, 21 based on Foata normal form. 0/1845 useless extension candidates. Maximal degree in co-relation 2244. Up to 62 conditions per place. [2025-03-08 22:05:03,402 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 19 selfloop transitions, 2 changer transitions 0/972 dead transitions. [2025-03-08 22:05:03,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 972 transitions, 1994 flow [2025-03-08 22:05:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3025 transitions. [2025-03-08 22:05:03,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621501272264631 [2025-03-08 22:05:03,408 INFO L175 Difference]: Start difference. First operand has 962 places, 973 transitions, 1954 flow. Second operand 3 states and 3025 transitions. [2025-03-08 22:05:03,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 972 transitions, 1994 flow [2025-03-08 22:05:03,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 972 transitions, 1993 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:03,425 INFO L231 Difference]: Finished difference. Result has 962 places, 972 transitions, 1955 flow [2025-03-08 22:05:03,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1955, PETRI_PLACES=962, PETRI_TRANSITIONS=972} [2025-03-08 22:05:03,427 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -31 predicate places. [2025-03-08 22:05:03,427 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 972 transitions, 1955 flow [2025-03-08 22:05:03,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states 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:03,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:03,429 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] [2025-03-08 22:05:03,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:05:03,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:03,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 954477337, now seen corresponding path program 1 times [2025-03-08 22:05:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:03,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418704168] [2025-03-08 22:05:03,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:03,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:05:03,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:05:03,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:03,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:03,494 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:03,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:03,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418704168] [2025-03-08 22:05:03,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418704168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:03,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:03,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:03,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727524194] [2025-03-08 22:05:03,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:03,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:03,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:03,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:03,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1048 [2025-03-08 22:05:03,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 972 transitions, 1955 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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:03,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:03,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1048 [2025-03-08 22:05:03,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:03,946 INFO L124 PetriNetUnfolderBase]: 116/2624 cut-off events. [2025-03-08 22:05:03,946 INFO L125 PetriNetUnfolderBase]: For 17/119 co-relation queries the response was YES. [2025-03-08 22:05:03,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 2624 events. 116/2624 cut-off events. For 17/119 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 15973 event pairs, 60 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 2753. Up to 149 conditions per place. [2025-03-08 22:05:04,002 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/962 dead transitions. [2025-03-08 22:05:04,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 962 transitions, 1989 flow [2025-03-08 22:05:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2025-03-08 22:05:04,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535623409669212 [2025-03-08 22:05:04,006 INFO L175 Difference]: Start difference. First operand has 962 places, 972 transitions, 1955 flow. Second operand 3 states and 2998 transitions. [2025-03-08 22:05:04,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 962 transitions, 1989 flow [2025-03-08 22:05:04,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 962 transitions, 1985 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:04,017 INFO L231 Difference]: Finished difference. Result has 952 places, 962 transitions, 1933 flow [2025-03-08 22:05:04,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=961, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1933, PETRI_PLACES=952, PETRI_TRANSITIONS=962} [2025-03-08 22:05:04,019 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -41 predicate places. [2025-03-08 22:05:04,019 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 962 transitions, 1933 flow [2025-03-08 22:05:04,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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:04,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:04,021 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] [2025-03-08 22:05:04,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:05:04,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -906115713, now seen corresponding path program 1 times [2025-03-08 22:05:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590297262] [2025-03-08 22:05:04,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:04,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:05:04,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:05:04,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:04,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:04,086 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:04,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:04,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590297262] [2025-03-08 22:05:04,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590297262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:04,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:04,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316440618] [2025-03-08 22:05:04,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:04,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:04,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:04,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:04,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:04,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2025-03-08 22:05:04,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 962 transitions, 1933 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states 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:04,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:04,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2025-03-08 22:05:04,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:04,375 INFO L124 PetriNetUnfolderBase]: 74/1837 cut-off events. [2025-03-08 22:05:04,375 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2025-03-08 22:05:04,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 1837 events. 74/1837 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8546 event pairs, 39 based on Foata normal form. 0/1563 useless extension candidates. Maximal degree in co-relation 1895. Up to 89 conditions per place. [2025-03-08 22:05:04,402 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 19 selfloop transitions, 2 changer transitions 0/961 dead transitions. [2025-03-08 22:05:04,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 961 transitions, 1973 flow [2025-03-08 22:05:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3025 transitions. [2025-03-08 22:05:04,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621501272264631 [2025-03-08 22:05:04,406 INFO L175 Difference]: Start difference. First operand has 952 places, 962 transitions, 1933 flow. Second operand 3 states and 3025 transitions. [2025-03-08 22:05:04,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 961 transitions, 1973 flow [2025-03-08 22:05:04,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 961 transitions, 1972 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:04,419 INFO L231 Difference]: Finished difference. Result has 952 places, 961 transitions, 1934 flow [2025-03-08 22:05:04,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1934, PETRI_PLACES=952, PETRI_TRANSITIONS=961} [2025-03-08 22:05:04,421 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -41 predicate places. [2025-03-08 22:05:04,421 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 961 transitions, 1934 flow [2025-03-08 22:05:04,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states 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:04,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:04,423 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] [2025-03-08 22:05:04,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:05:04,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1700716812, now seen corresponding path program 1 times [2025-03-08 22:05:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418541347] [2025-03-08 22:05:04,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:04,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:05:04,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:05:04,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:04,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:04,473 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:04,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:04,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418541347] [2025-03-08 22:05:04,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418541347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:04,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:04,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:04,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079163135] [2025-03-08 22:05:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:04,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:04,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:04,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:04,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1048 [2025-03-08 22:05:04,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 961 transitions, 1934 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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:04,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:04,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1048 [2025-03-08 22:05:04,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:05,064 INFO L124 PetriNetUnfolderBase]: 226/3707 cut-off events. [2025-03-08 22:05:05,064 INFO L125 PetriNetUnfolderBase]: For 65/94 co-relation queries the response was YES. [2025-03-08 22:05:05,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 3707 events. 226/3707 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 27028 event pairs, 132 based on Foata normal form. 0/3158 useless extension candidates. Maximal degree in co-relation 3956. Up to 274 conditions per place. [2025-03-08 22:05:05,116 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/951 dead transitions. [2025-03-08 22:05:05,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 951 transitions, 1968 flow [2025-03-08 22:05:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2025-03-08 22:05:05,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535623409669212 [2025-03-08 22:05:05,120 INFO L175 Difference]: Start difference. First operand has 952 places, 961 transitions, 1934 flow. Second operand 3 states and 2998 transitions. [2025-03-08 22:05:05,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 944 places, 951 transitions, 1968 flow [2025-03-08 22:05:05,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 951 transitions, 1964 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:05,129 INFO L231 Difference]: Finished difference. Result has 942 places, 951 transitions, 1912 flow [2025-03-08 22:05:05,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=950, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1912, PETRI_PLACES=942, PETRI_TRANSITIONS=951} [2025-03-08 22:05:05,131 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2025-03-08 22:05:05,131 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 951 transitions, 1912 flow [2025-03-08 22:05:05,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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:05,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:05,133 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] [2025-03-08 22:05:05,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:05:05,133 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:05,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:05,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1085972232, now seen corresponding path program 1 times [2025-03-08 22:05:05,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:05,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703843470] [2025-03-08 22:05:05,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:05,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 22:05:05,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 22:05:05,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:05,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:05,183 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:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703843470] [2025-03-08 22:05:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703843470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:05,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:05,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:05,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891595960] [2025-03-08 22:05:05,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:05,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:05,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:05,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:05,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:05,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1048 [2025-03-08 22:05:05,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 951 transitions, 1912 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states 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:05,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:05,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1048 [2025-03-08 22:05:05,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:05,395 INFO L124 PetriNetUnfolderBase]: 25/1251 cut-off events. [2025-03-08 22:05:05,395 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-08 22:05:05,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1251 events. 25/1251 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3306 event pairs, 2 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 1236. Up to 16 conditions per place. [2025-03-08 22:05:05,412 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/950 dead transitions. [2025-03-08 22:05:05,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 950 transitions, 1936 flow [2025-03-08 22:05:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2025-03-08 22:05:05,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672391857506362 [2025-03-08 22:05:05,418 INFO L175 Difference]: Start difference. First operand has 942 places, 951 transitions, 1912 flow. Second operand 3 states and 3041 transitions. [2025-03-08 22:05:05,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 950 transitions, 1936 flow [2025-03-08 22:05:05,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 950 transitions, 1935 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:05,431 INFO L231 Difference]: Finished difference. Result has 942 places, 950 transitions, 1913 flow [2025-03-08 22:05:05,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=950, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=948, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1913, PETRI_PLACES=942, PETRI_TRANSITIONS=950} [2025-03-08 22:05:05,433 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2025-03-08 22:05:05,433 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 950 transitions, 1913 flow [2025-03-08 22:05:05,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states 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:05,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:05,435 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] [2025-03-08 22:05:05,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:05:05,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:05,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1178601458, now seen corresponding path program 1 times [2025-03-08 22:05:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:05,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346524255] [2025-03-08 22:05:05,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:05,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 22:05:05,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 22:05:05,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:05,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:05,484 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:05,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:05,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346524255] [2025-03-08 22:05:05,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346524255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:05,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:05,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92205029] [2025-03-08 22:05:05,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:05,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:05,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:05,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:05,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:05,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-08 22:05:05,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 950 transitions, 1913 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:05,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:05,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-08 22:05:05,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:05,877 INFO L124 PetriNetUnfolderBase]: 41/1852 cut-off events. [2025-03-08 22:05:05,877 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:05:05,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 1852 events. 41/1852 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8327 event pairs, 6 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 1852. Up to 25 conditions per place. [2025-03-08 22:05:05,908 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/949 dead transitions. [2025-03-08 22:05:05,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 949 transitions, 1939 flow [2025-03-08 22:05:05,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-08 22:05:05,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-08 22:05:05,914 INFO L175 Difference]: Start difference. First operand has 942 places, 950 transitions, 1913 flow. Second operand 3 states and 3039 transitions. [2025-03-08 22:05:05,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 949 transitions, 1939 flow [2025-03-08 22:05:05,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 949 transitions, 1935 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:05,927 INFO L231 Difference]: Finished difference. Result has 941 places, 949 transitions, 1911 flow [2025-03-08 22:05:05,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=939, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1911, PETRI_PLACES=941, PETRI_TRANSITIONS=949} [2025-03-08 22:05:05,931 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -52 predicate places. [2025-03-08 22:05:05,932 INFO L471 AbstractCegarLoop]: Abstraction has has 941 places, 949 transitions, 1911 flow [2025-03-08 22:05:05,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:05,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:05,933 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] [2025-03-08 22:05:05,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:05:05,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:05,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash -754117956, now seen corresponding path program 1 times [2025-03-08 22:05:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:05,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665487495] [2025-03-08 22:05:05,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:05,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:05,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 22:05:05,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 22:05:05,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:05,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:06,006 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:06,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:06,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665487495] [2025-03-08 22:05:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665487495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:06,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467258568] [2025-03-08 22:05:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:06,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:06,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:06,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:06,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-08 22:05:06,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 949 transitions, 1911 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:06,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:06,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-08 22:05:06,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:06,263 INFO L124 PetriNetUnfolderBase]: 41/1851 cut-off events. [2025-03-08 22:05:06,263 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:05:06,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 1851 events. 41/1851 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8277 event pairs, 6 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 1851. Up to 25 conditions per place. [2025-03-08 22:05:06,291 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/948 dead transitions. [2025-03-08 22:05:06,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 948 transitions, 1937 flow [2025-03-08 22:05:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-08 22:05:06,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-08 22:05:06,295 INFO L175 Difference]: Start difference. First operand has 941 places, 949 transitions, 1911 flow. Second operand 3 states and 3039 transitions. [2025-03-08 22:05:06,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 948 transitions, 1937 flow [2025-03-08 22:05:06,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 948 transitions, 1933 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:06,305 INFO L231 Difference]: Finished difference. Result has 940 places, 948 transitions, 1909 flow [2025-03-08 22:05:06,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1909, PETRI_PLACES=940, PETRI_TRANSITIONS=948} [2025-03-08 22:05:06,307 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -53 predicate places. [2025-03-08 22:05:06,307 INFO L471 AbstractCegarLoop]: Abstraction has has 940 places, 948 transitions, 1909 flow [2025-03-08 22:05:06,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:06,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:06,309 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] [2025-03-08 22:05:06,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:05:06,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash -58618866, now seen corresponding path program 1 times [2025-03-08 22:05:06,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:06,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240238225] [2025-03-08 22:05:06,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:06,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:06,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:05:06,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:05:06,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:06,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:06,345 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:06,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:06,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240238225] [2025-03-08 22:05:06,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240238225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:06,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:06,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:06,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274891609] [2025-03-08 22:05:06,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:06,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:06,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:06,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:06,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:06,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-08 22:05:06,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 948 transitions, 1909 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:06,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:06,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-08 22:05:06,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:06,490 INFO L124 PetriNetUnfolderBase]: 22/1098 cut-off events. [2025-03-08 22:05:06,490 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:05:06,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 1098 events. 22/1098 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2537 event pairs, 2 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1085. Up to 17 conditions per place. [2025-03-08 22:05:06,506 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/947 dead transitions. [2025-03-08 22:05:06,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 947 transitions, 1935 flow [2025-03-08 22:05:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-08 22:05:06,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-08 22:05:06,510 INFO L175 Difference]: Start difference. First operand has 940 places, 948 transitions, 1909 flow. Second operand 3 states and 3039 transitions. [2025-03-08 22:05:06,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 947 transitions, 1935 flow [2025-03-08 22:05:06,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 947 transitions, 1931 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:06,520 INFO L231 Difference]: Finished difference. Result has 939 places, 947 transitions, 1907 flow [2025-03-08 22:05:06,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1907, PETRI_PLACES=939, PETRI_TRANSITIONS=947} [2025-03-08 22:05:06,521 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -54 predicate places. [2025-03-08 22:05:06,522 INFO L471 AbstractCegarLoop]: Abstraction has has 939 places, 947 transitions, 1907 flow [2025-03-08 22:05:06,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:06,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:06,523 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] [2025-03-08 22:05:06,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:05:06,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:06,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1297329092, now seen corresponding path program 1 times [2025-03-08 22:05:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498478112] [2025-03-08 22:05:06,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:06,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:05:06,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:05:06,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:06,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:06,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:06,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498478112] [2025-03-08 22:05:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498478112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:06,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:06,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805765911] [2025-03-08 22:05:06,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:06,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:06,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:06,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:06,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-08 22:05:06,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 947 transitions, 1907 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:06,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:06,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-08 22:05:06,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:06,752 INFO L124 PetriNetUnfolderBase]: 32/1399 cut-off events. [2025-03-08 22:05:06,752 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-08 22:05:06,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 1399 events. 32/1399 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4854 event pairs, 6 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 1396. Up to 25 conditions per place. [2025-03-08 22:05:06,777 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2025-03-08 22:05:06,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 946 transitions, 1933 flow [2025-03-08 22:05:06,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-08 22:05:06,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-08 22:05:06,780 INFO L175 Difference]: Start difference. First operand has 939 places, 947 transitions, 1907 flow. Second operand 3 states and 3039 transitions. [2025-03-08 22:05:06,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 940 places, 946 transitions, 1933 flow [2025-03-08 22:05:06,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 938 places, 946 transitions, 1929 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:06,790 INFO L231 Difference]: Finished difference. Result has 938 places, 946 transitions, 1905 flow [2025-03-08 22:05:06,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1905, PETRI_PLACES=938, PETRI_TRANSITIONS=946} [2025-03-08 22:05:06,792 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -55 predicate places. [2025-03-08 22:05:06,792 INFO L471 AbstractCegarLoop]: Abstraction has has 938 places, 946 transitions, 1905 flow [2025-03-08 22:05:06,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:06,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:06,794 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] [2025-03-08 22:05:06,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:05:06,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:06,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:06,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1834164293, now seen corresponding path program 1 times [2025-03-08 22:05:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:06,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613921172] [2025-03-08 22:05:06,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:06,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:05:06,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:05:06,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:06,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:06,843 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:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:06,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613921172] [2025-03-08 22:05:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613921172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:06,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:06,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062648310] [2025-03-08 22:05:06,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:06,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:06,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:06,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:06,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:06,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-08 22:05:06,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 946 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:06,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:06,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-08 22:05:06,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:07,044 INFO L124 PetriNetUnfolderBase]: 32/1398 cut-off events. [2025-03-08 22:05:07,044 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-08 22:05:07,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 1398 events. 32/1398 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4835 event pairs, 6 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 1395. Up to 25 conditions per place. [2025-03-08 22:05:07,068 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/945 dead transitions. [2025-03-08 22:05:07,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 945 transitions, 1931 flow [2025-03-08 22:05:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-08 22:05:07,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-08 22:05:07,072 INFO L175 Difference]: Start difference. First operand has 938 places, 946 transitions, 1905 flow. Second operand 3 states and 3039 transitions. [2025-03-08 22:05:07,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 945 transitions, 1931 flow [2025-03-08 22:05:07,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 945 transitions, 1927 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:07,082 INFO L231 Difference]: Finished difference. Result has 937 places, 945 transitions, 1903 flow [2025-03-08 22:05:07,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=937, PETRI_TRANSITIONS=945} [2025-03-08 22:05:07,084 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -56 predicate places. [2025-03-08 22:05:07,084 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 945 transitions, 1903 flow [2025-03-08 22:05:07,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:07,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:07,089 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] [2025-03-08 22:05:07,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:05:07,089 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:07,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:07,090 INFO L85 PathProgramCache]: Analyzing trace with hash -955132685, now seen corresponding path program 1 times [2025-03-08 22:05:07,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:07,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917925355] [2025-03-08 22:05:07,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:07,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:07,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 22:05:07,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 22:05:07,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:07,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:07,136 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:07,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:07,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917925355] [2025-03-08 22:05:07,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917925355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:07,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:07,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:07,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161190276] [2025-03-08 22:05:07,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:07,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:07,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:07,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:07,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:07,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-08 22:05:07,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 945 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:07,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:07,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-08 22:05:07,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:07,259 INFO L124 PetriNetUnfolderBase]: 19/974 cut-off events. [2025-03-08 22:05:07,260 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-08 22:05:07,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 974 events. 19/974 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2070 event pairs, 2 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 960. Up to 17 conditions per place. [2025-03-08 22:05:07,268 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2025-03-08 22:05:07,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 944 transitions, 1929 flow [2025-03-08 22:05:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-08 22:05:07,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-08 22:05:07,271 INFO L175 Difference]: Start difference. First operand has 937 places, 945 transitions, 1903 flow. Second operand 3 states and 3039 transitions. [2025-03-08 22:05:07,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 944 transitions, 1929 flow [2025-03-08 22:05:07,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 944 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:07,280 INFO L231 Difference]: Finished difference. Result has 936 places, 944 transitions, 1901 flow [2025-03-08 22:05:07,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=936, PETRI_TRANSITIONS=944} [2025-03-08 22:05:07,281 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -57 predicate places. [2025-03-08 22:05:07,281 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 944 transitions, 1901 flow [2025-03-08 22:05:07,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:07,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:07,282 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] [2025-03-08 22:05:07,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:05:07,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:07,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash -221034529, now seen corresponding path program 1 times [2025-03-08 22:05:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:07,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62240481] [2025-03-08 22:05:07,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:07,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 22:05:07,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 22:05:07,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:07,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:07,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:07,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62240481] [2025-03-08 22:05:07,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62240481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:07,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:07,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849108348] [2025-03-08 22:05:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:07,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:07,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:07,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:07,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-08 22:05:07,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 944 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:07,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:07,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-08 22:05:07,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:07,472 INFO L124 PetriNetUnfolderBase]: 29/1209 cut-off events. [2025-03-08 22:05:07,472 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-08 22:05:07,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 1209 events. 29/1209 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3077 event pairs, 6 based on Foata normal form. 0/1065 useless extension candidates. Maximal degree in co-relation 1203. Up to 25 conditions per place. [2025-03-08 22:05:07,489 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/943 dead transitions. [2025-03-08 22:05:07,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 943 transitions, 1927 flow [2025-03-08 22:05:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-08 22:05:07,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-08 22:05:07,493 INFO L175 Difference]: Start difference. First operand has 936 places, 944 transitions, 1901 flow. Second operand 3 states and 3039 transitions. [2025-03-08 22:05:07,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 943 transitions, 1927 flow [2025-03-08 22:05:07,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 943 transitions, 1923 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:07,502 INFO L231 Difference]: Finished difference. Result has 935 places, 943 transitions, 1899 flow [2025-03-08 22:05:07,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=935, PETRI_TRANSITIONS=943} [2025-03-08 22:05:07,504 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -58 predicate places. [2025-03-08 22:05:07,504 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 943 transitions, 1899 flow [2025-03-08 22:05:07,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:07,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:07,505 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:07,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:05:07,505 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:07,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1361236959, now seen corresponding path program 1 times [2025-03-08 22:05:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:07,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325356052] [2025-03-08 22:05:07,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:07,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:07,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:05:07,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:05:07,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:07,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:07,545 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:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325356052] [2025-03-08 22:05:07,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325356052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:07,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:07,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:07,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959808668] [2025-03-08 22:05:07,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:07,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:07,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:07,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:07,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-08 22:05:07,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 943 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:07,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:07,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-08 22:05:07,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:07,699 INFO L124 PetriNetUnfolderBase]: 29/1170 cut-off events. [2025-03-08 22:05:07,699 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-08 22:05:07,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 1170 events. 29/1170 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2954 event pairs, 6 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1164. Up to 25 conditions per place. [2025-03-08 22:05:07,717 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2025-03-08 22:05:07,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 942 transitions, 1925 flow [2025-03-08 22:05:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-08 22:05:07,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-08 22:05:07,721 INFO L175 Difference]: Start difference. First operand has 935 places, 943 transitions, 1899 flow. Second operand 3 states and 3039 transitions. [2025-03-08 22:05:07,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 942 transitions, 1925 flow [2025-03-08 22:05:07,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 942 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:07,730 INFO L231 Difference]: Finished difference. Result has 934 places, 942 transitions, 1897 flow [2025-03-08 22:05:07,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1897, PETRI_PLACES=934, PETRI_TRANSITIONS=942} [2025-03-08 22:05:07,732 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -59 predicate places. [2025-03-08 22:05:07,732 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 942 transitions, 1897 flow [2025-03-08 22:05:07,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states 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:07,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:07,732 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] [2025-03-08 22:05:07,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:05:07,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:07,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash -760226022, now seen corresponding path program 1 times [2025-03-08 22:05:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:07,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285618947] [2025-03-08 22:05:07,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:07,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:07,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 22:05:07,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 22:05:07,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:07,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:07,804 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:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285618947] [2025-03-08 22:05:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285618947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:07,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:07,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:07,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457797159] [2025-03-08 22:05:07,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:07,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:07,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:07,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:07,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1048 [2025-03-08 22:05:07,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 942 transitions, 1897 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states 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:07,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:07,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1048 [2025-03-08 22:05:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:08,121 INFO L124 PetriNetUnfolderBase]: 61/2113 cut-off events. [2025-03-08 22:05:08,121 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:05:08,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 2113 events. 61/2113 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10794 event pairs, 20 based on Foata normal form. 0/1818 useless extension candidates. Maximal degree in co-relation 2142. Up to 50 conditions per place. [2025-03-08 22:05:08,145 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/941 dead transitions. [2025-03-08 22:05:08,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 941 transitions, 1925 flow [2025-03-08 22:05:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2025-03-08 22:05:08,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659669211195929 [2025-03-08 22:05:08,149 INFO L175 Difference]: Start difference. First operand has 934 places, 942 transitions, 1897 flow. Second operand 3 states and 3037 transitions. [2025-03-08 22:05:08,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 941 transitions, 1925 flow [2025-03-08 22:05:08,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 941 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:08,158 INFO L231 Difference]: Finished difference. Result has 933 places, 941 transitions, 1895 flow [2025-03-08 22:05:08,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=933, PETRI_TRANSITIONS=941} [2025-03-08 22:05:08,159 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -60 predicate places. [2025-03-08 22:05:08,159 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 941 transitions, 1895 flow [2025-03-08 22:05:08,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states 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:08,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:08,160 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] [2025-03-08 22:05:08,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:05:08,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1432425491, now seen corresponding path program 1 times [2025-03-08 22:05:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710262083] [2025-03-08 22:05:08,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:08,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 22:05:08,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 22:05:08,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:08,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:08,666 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:08,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710262083] [2025-03-08 22:05:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710262083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:08,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:08,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273213125] [2025-03-08 22:05:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:08,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:08,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:08,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:09,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 919 out of 1048 [2025-03-08 22:05:09,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 941 transitions, 1895 flow. Second operand has 6 states, 6 states have (on average 920.5) internal successors, (5523), 6 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states 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:09,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:09,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 919 of 1048 [2025-03-08 22:05:09,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:22,753 INFO L124 PetriNetUnfolderBase]: 15256/85355 cut-off events. [2025-03-08 22:05:22,753 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-03-08 22:05:23,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107784 conditions, 85355 events. 15256/85355 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 1264011 event pairs, 14040 based on Foata normal form. 0/74617 useless extension candidates. Maximal degree in co-relation 107742. Up to 22026 conditions per place. [2025-03-08 22:05:23,439 INFO L140 encePairwiseOnDemand]: 1030/1048 looper letters, 87 selfloop transitions, 15 changer transitions 0/938 dead transitions. [2025-03-08 22:05:23,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 938 transitions, 2093 flow [2025-03-08 22:05:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5619 transitions. [2025-03-08 22:05:23,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8936068702290076 [2025-03-08 22:05:23,447 INFO L175 Difference]: Start difference. First operand has 933 places, 941 transitions, 1895 flow. Second operand 6 states and 5619 transitions. [2025-03-08 22:05:23,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 938 transitions, 2093 flow [2025-03-08 22:05:23,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 938 transitions, 2089 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:23,456 INFO L231 Difference]: Finished difference. Result has 933 places, 938 transitions, 1915 flow [2025-03-08 22:05:23,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1915, PETRI_PLACES=933, PETRI_TRANSITIONS=938} [2025-03-08 22:05:23,457 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -60 predicate places. [2025-03-08 22:05:23,457 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 938 transitions, 1915 flow [2025-03-08 22:05:23,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 920.5) internal successors, (5523), 6 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states 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:23,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:23,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:23,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:05:23,459 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:23,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1856402539, now seen corresponding path program 1 times [2025-03-08 22:05:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413997613] [2025-03-08 22:05:23,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:23,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 22:05:23,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 22:05:23,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:23,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:23,536 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:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413997613] [2025-03-08 22:05:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413997613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:23,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:23,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326145005] [2025-03-08 22:05:23,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:23,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:23,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:23,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:23,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1048 [2025-03-08 22:05:23,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 938 transitions, 1915 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states 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:23,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:23,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1048 [2025-03-08 22:05:23,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:23,980 INFO L124 PetriNetUnfolderBase]: 47/1835 cut-off events. [2025-03-08 22:05:23,980 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-03-08 22:05:24,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 1835 events. 47/1835 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7516 event pairs, 12 based on Foata normal form. 0/1592 useless extension candidates. Maximal degree in co-relation 1859. Up to 38 conditions per place. [2025-03-08 22:05:24,010 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/937 dead transitions. [2025-03-08 22:05:24,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 937 transitions, 1943 flow [2025-03-08 22:05:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2025-03-08 22:05:24,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659669211195929 [2025-03-08 22:05:24,013 INFO L175 Difference]: Start difference. First operand has 933 places, 938 transitions, 1915 flow. Second operand 3 states and 3037 transitions. [2025-03-08 22:05:24,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 937 transitions, 1943 flow [2025-03-08 22:05:24,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 937 transitions, 1913 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:24,023 INFO L231 Difference]: Finished difference. Result has 929 places, 937 transitions, 1887 flow [2025-03-08 22:05:24,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=929, PETRI_TRANSITIONS=937} [2025-03-08 22:05:24,024 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -64 predicate places. [2025-03-08 22:05:24,025 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 937 transitions, 1887 flow [2025-03-08 22:05:24,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states 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:24,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:05:24,026 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:24,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:24,027 INFO L85 PathProgramCache]: Analyzing trace with hash -252349388, now seen corresponding path program 1 times [2025-03-08 22:05:24,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:24,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401882286] [2025-03-08 22:05:24,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:24,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 22:05:24,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 22:05:24,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:24,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:24,100 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:24,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:24,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401882286] [2025-03-08 22:05:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401882286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:24,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:24,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284833197] [2025-03-08 22:05:24,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:24,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:24,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:24,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:24,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:24,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1048 [2025-03-08 22:05:24,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 937 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states 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:24,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:24,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1048 [2025-03-08 22:05:24,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:24,319 INFO L124 PetriNetUnfolderBase]: 52/1631 cut-off events. [2025-03-08 22:05:24,319 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2025-03-08 22:05:24,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1631 events. 52/1631 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6180 event pairs, 20 based on Foata normal form. 0/1424 useless extension candidates. Maximal degree in co-relation 1652. Up to 50 conditions per place. [2025-03-08 22:05:24,342 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/936 dead transitions. [2025-03-08 22:05:24,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 936 transitions, 1915 flow [2025-03-08 22:05:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2025-03-08 22:05:24,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659669211195929 [2025-03-08 22:05:24,347 INFO L175 Difference]: Start difference. First operand has 929 places, 937 transitions, 1887 flow. Second operand 3 states and 3037 transitions. [2025-03-08 22:05:24,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 936 transitions, 1915 flow [2025-03-08 22:05:24,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 936 transitions, 1911 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:24,355 INFO L231 Difference]: Finished difference. Result has 928 places, 936 transitions, 1885 flow [2025-03-08 22:05:24,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1885, PETRI_PLACES=928, PETRI_TRANSITIONS=936} [2025-03-08 22:05:24,357 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -65 predicate places. [2025-03-08 22:05:24,357 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 936 transitions, 1885 flow [2025-03-08 22:05:24,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states 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:24,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:24,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:05:24,358 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:24,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash 98411887, now seen corresponding path program 1 times [2025-03-08 22:05:24,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915260591] [2025-03-08 22:05:24,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:24,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-08 22:05:24,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-08 22:05:24,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:24,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:24,499 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:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:24,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915260591] [2025-03-08 22:05:24,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915260591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:24,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:24,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:24,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247770744] [2025-03-08 22:05:24,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:24,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:24,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:24,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:24,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 919 out of 1048 [2025-03-08 22:05:24,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 936 transitions, 1885 flow. Second operand has 3 states, 3 states have (on average 921.0) internal successors, (2763), 3 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states 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:24,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:24,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 919 of 1048 [2025-03-08 22:05:24,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:37,603 INFO L124 PetriNetUnfolderBase]: 15256/85350 cut-off events. [2025-03-08 22:05:37,603 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-03-08 22:05:37,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107779 conditions, 85350 events. 15256/85350 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 1263839 event pairs, 14040 based on Foata normal form. 0/74617 useless extension candidates. Maximal degree in co-relation 107737. Up to 22035 conditions per place. [2025-03-08 22:05:38,192 INFO L140 encePairwiseOnDemand]: 1039/1048 looper letters, 96 selfloop transitions, 6 changer transitions 0/933 dead transitions. [2025-03-08 22:05:38,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 933 transitions, 2083 flow [2025-03-08 22:05:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2862 transitions. [2025-03-08 22:05:38,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103053435114504 [2025-03-08 22:05:38,195 INFO L175 Difference]: Start difference. First operand has 928 places, 936 transitions, 1885 flow. Second operand 3 states and 2862 transitions. [2025-03-08 22:05:38,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 933 transitions, 2083 flow [2025-03-08 22:05:38,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 933 transitions, 2079 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:38,202 INFO L231 Difference]: Finished difference. Result has 925 places, 933 transitions, 1887 flow [2025-03-08 22:05:38,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=925, PETRI_TRANSITIONS=933} [2025-03-08 22:05:38,203 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -68 predicate places. [2025-03-08 22:05:38,203 INFO L471 AbstractCegarLoop]: Abstraction has has 925 places, 933 transitions, 1887 flow [2025-03-08 22:05:38,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 921.0) internal successors, (2763), 3 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states 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:38,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:38,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:05:38,204 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1501051719, now seen corresponding path program 1 times [2025-03-08 22:05:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:38,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561549702] [2025-03-08 22:05:38,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:38,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 22:05:38,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 22:05:38,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:38,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:38,395 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:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561549702] [2025-03-08 22:05:38,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561549702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:38,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:38,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:38,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013247825] [2025-03-08 22:05:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:38,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:38,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:38,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:38,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:38,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1048 [2025-03-08 22:05:38,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 933 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states 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:38,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:38,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1048 [2025-03-08 22:05:38,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:38,674 INFO L124 PetriNetUnfolderBase]: 36/1535 cut-off events. [2025-03-08 22:05:38,674 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-08 22:05:38,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 1535 events. 36/1535 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5796 event pairs, 7 based on Foata normal form. 0/1349 useless extension candidates. Maximal degree in co-relation 1550. Up to 25 conditions per place. [2025-03-08 22:05:38,696 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/932 dead transitions. [2025-03-08 22:05:38,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 932 transitions, 1911 flow [2025-03-08 22:05:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2025-03-08 22:05:38,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672391857506362 [2025-03-08 22:05:38,699 INFO L175 Difference]: Start difference. First operand has 925 places, 933 transitions, 1887 flow. Second operand 3 states and 3041 transitions. [2025-03-08 22:05:38,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 932 transitions, 1911 flow [2025-03-08 22:05:38,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 932 transitions, 1899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:38,708 INFO L231 Difference]: Finished difference. Result has 924 places, 932 transitions, 1877 flow [2025-03-08 22:05:38,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1877, PETRI_PLACES=924, PETRI_TRANSITIONS=932} [2025-03-08 22:05:38,709 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -69 predicate places. [2025-03-08 22:05:38,709 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 932 transitions, 1877 flow [2025-03-08 22:05:38,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states 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:38,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:05:38,710 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:38,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash 825668778, now seen corresponding path program 1 times [2025-03-08 22:05:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:38,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486073663] [2025-03-08 22:05:38,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:38,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-08 22:05:38,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-08 22:05:38,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:38,795 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:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486073663] [2025-03-08 22:05:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486073663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:38,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750308622] [2025-03-08 22:05:38,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:38,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:38,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:38,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:38,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1048 [2025-03-08 22:05:38,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 932 transitions, 1877 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states 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:38,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:38,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1048 [2025-03-08 22:05:38,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:39,055 INFO L124 PetriNetUnfolderBase]: 34/1447 cut-off events. [2025-03-08 22:05:39,055 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-08 22:05:39,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1447 events. 34/1447 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4557 event pairs, 5 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 1440. Up to 22 conditions per place. [2025-03-08 22:05:39,076 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/931 dead transitions. [2025-03-08 22:05:39,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 931 transitions, 1901 flow [2025-03-08 22:05:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2025-03-08 22:05:39,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672391857506362 [2025-03-08 22:05:39,080 INFO L175 Difference]: Start difference. First operand has 924 places, 932 transitions, 1877 flow. Second operand 3 states and 3041 transitions. [2025-03-08 22:05:39,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 931 transitions, 1901 flow [2025-03-08 22:05:39,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 931 transitions, 1897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:39,090 INFO L231 Difference]: Finished difference. Result has 923 places, 931 transitions, 1875 flow [2025-03-08 22:05:39,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1875, PETRI_PLACES=923, PETRI_TRANSITIONS=931} [2025-03-08 22:05:39,091 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -70 predicate places. [2025-03-08 22:05:39,092 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 931 transitions, 1875 flow [2025-03-08 22:05:39,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states 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:39,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:39,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:05:39,093 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:39,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1456552041, now seen corresponding path program 1 times [2025-03-08 22:05:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726315383] [2025-03-08 22:05:39,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:39,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:39,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 22:05:39,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 22:05:39,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:39,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:39,185 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:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:39,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726315383] [2025-03-08 22:05:39,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726315383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:39,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:39,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801497699] [2025-03-08 22:05:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:39,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:39,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:39,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:39,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1048 [2025-03-08 22:05:39,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 931 transitions, 1875 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states 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:39,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:39,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1048 [2025-03-08 22:05:39,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:39,422 INFO L124 PetriNetUnfolderBase]: 32/1276 cut-off events. [2025-03-08 22:05:39,422 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-08 22:05:39,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1276 events. 32/1276 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3628 event pairs, 7 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1272. Up to 26 conditions per place. [2025-03-08 22:05:39,443 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/930 dead transitions. [2025-03-08 22:05:39,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 930 transitions, 1899 flow [2025-03-08 22:05:39,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2025-03-08 22:05:39,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672391857506362 [2025-03-08 22:05:39,445 INFO L175 Difference]: Start difference. First operand has 923 places, 931 transitions, 1875 flow. Second operand 3 states and 3041 transitions. [2025-03-08 22:05:39,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 930 transitions, 1899 flow [2025-03-08 22:05:39,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 930 transitions, 1895 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:39,455 INFO L231 Difference]: Finished difference. Result has 922 places, 930 transitions, 1873 flow [2025-03-08 22:05:39,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1869, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1873, PETRI_PLACES=922, PETRI_TRANSITIONS=930} [2025-03-08 22:05:39,455 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -71 predicate places. [2025-03-08 22:05:39,455 INFO L471 AbstractCegarLoop]: Abstraction has has 922 places, 930 transitions, 1873 flow [2025-03-08 22:05:39,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states 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:39,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:39,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:05:39,456 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:39,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1404160852, now seen corresponding path program 1 times [2025-03-08 22:05:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:39,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427706828] [2025-03-08 22:05:39,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:39,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 22:05:39,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 22:05:39,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:39,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:39,542 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:39,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:39,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427706828] [2025-03-08 22:05:39,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427706828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:39,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:39,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50347390] [2025-03-08 22:05:39,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:39,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:39,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:39,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:39,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:39,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1005 out of 1048 [2025-03-08 22:05:39,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 922 places, 930 transitions, 1873 flow. Second operand has 3 states, 3 states have (on average 1006.3333333333334) internal successors, (3019), 3 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states 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:39,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:39,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1005 of 1048 [2025-03-08 22:05:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:40,104 INFO L124 PetriNetUnfolderBase]: 115/2918 cut-off events. [2025-03-08 22:05:40,104 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:05:40,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 2918 events. 115/2918 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 18663 event pairs, 28 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 3046. Up to 127 conditions per place. [2025-03-08 22:05:40,157 INFO L140 encePairwiseOnDemand]: 1042/1048 looper letters, 17 selfloop transitions, 2 changer transitions 0/930 dead transitions. [2025-03-08 22:05:40,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 930 transitions, 1913 flow [2025-03-08 22:05:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3038 transitions. [2025-03-08 22:05:40,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662849872773537 [2025-03-08 22:05:40,160 INFO L175 Difference]: Start difference. First operand has 922 places, 930 transitions, 1873 flow. Second operand 3 states and 3038 transitions. [2025-03-08 22:05:40,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 930 transitions, 1913 flow [2025-03-08 22:05:40,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 930 transitions, 1909 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:40,173 INFO L231 Difference]: Finished difference. Result has 919 places, 928 transitions, 1875 flow [2025-03-08 22:05:40,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1875, PETRI_PLACES=919, PETRI_TRANSITIONS=928} [2025-03-08 22:05:40,174 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -74 predicate places. [2025-03-08 22:05:40,174 INFO L471 AbstractCegarLoop]: Abstraction has has 919 places, 928 transitions, 1875 flow [2025-03-08 22:05:40,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1006.3333333333334) internal successors, (3019), 3 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states 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:40,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:40,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:05:40,175 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:40,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1380878832, now seen corresponding path program 1 times [2025-03-08 22:05:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:40,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126770414] [2025-03-08 22:05:40,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:40,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-08 22:05:40,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-08 22:05:40,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:40,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:40,452 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:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126770414] [2025-03-08 22:05:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126770414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:40,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:40,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:05:40,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667037965] [2025-03-08 22:05:40,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:40,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:05:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:40,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:05:40,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:05:40,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 982 out of 1048 [2025-03-08 22:05:40,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 928 transitions, 1875 flow. Second operand has 7 states, 7 states have (on average 986.4285714285714) internal successors, (6905), 7 states have internal predecessors, (6905), 0 states have call successors, (0), 0 states 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:40,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:40,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 982 of 1048 [2025-03-08 22:05:40,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:41,109 INFO L124 PetriNetUnfolderBase]: 40/1995 cut-off events. [2025-03-08 22:05:41,109 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:05:41,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1995 events. 40/1995 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8867 event pairs, 0 based on Foata normal form. 1/1799 useless extension candidates. Maximal degree in co-relation 2050. Up to 39 conditions per place. [2025-03-08 22:05:41,141 INFO L140 encePairwiseOnDemand]: 1038/1048 looper letters, 67 selfloop transitions, 9 changer transitions 0/963 dead transitions. [2025-03-08 22:05:41,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 963 transitions, 2103 flow [2025-03-08 22:05:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:05:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 22:05:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6951 transitions. [2025-03-08 22:05:41,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475190839694656 [2025-03-08 22:05:41,144 INFO L175 Difference]: Start difference. First operand has 919 places, 928 transitions, 1875 flow. Second operand 7 states and 6951 transitions. [2025-03-08 22:05:41,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 963 transitions, 2103 flow [2025-03-08 22:05:41,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 963 transitions, 2103 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:41,152 INFO L231 Difference]: Finished difference. Result has 929 places, 934 transitions, 1932 flow [2025-03-08 22:05:41,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1932, PETRI_PLACES=929, PETRI_TRANSITIONS=934} [2025-03-08 22:05:41,154 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -64 predicate places. [2025-03-08 22:05:41,154 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 934 transitions, 1932 flow [2025-03-08 22:05:41,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 986.4285714285714) internal successors, (6905), 7 states have internal predecessors, (6905), 0 states have call successors, (0), 0 states 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:41,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:41,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:05:41,155 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:41,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash 253512419, now seen corresponding path program 1 times [2025-03-08 22:05:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:41,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740892607] [2025-03-08 22:05:41,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:41,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:41,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-08 22:05:41,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-08 22:05:41,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:41,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:41,376 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:41,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:41,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740892607] [2025-03-08 22:05:41,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740892607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:41,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:41,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:05:41,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853198115] [2025-03-08 22:05:41,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:41,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:05:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:41,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:05:41,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:05:41,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 977 out of 1048 [2025-03-08 22:05:41,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 934 transitions, 1932 flow. Second operand has 8 states, 8 states have (on average 981.375) internal successors, (7851), 8 states have internal predecessors, (7851), 0 states have call successors, (0), 0 states 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:41,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:41,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 977 of 1048 [2025-03-08 22:05:41,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:42,453 INFO L124 PetriNetUnfolderBase]: 58/2915 cut-off events. [2025-03-08 22:05:42,453 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2025-03-08 22:05:42,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3106 conditions, 2915 events. 58/2915 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16500 event pairs, 0 based on Foata normal form. 1/2623 useless extension candidates. Maximal degree in co-relation 3057. Up to 80 conditions per place. [2025-03-08 22:05:42,511 INFO L140 encePairwiseOnDemand]: 1035/1048 looper letters, 80 selfloop transitions, 13 changer transitions 0/975 dead transitions. [2025-03-08 22:05:42,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 975 transitions, 2220 flow [2025-03-08 22:05:42,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:05:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 22:05:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8881 transitions. [2025-03-08 22:05:42,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9415818490245971 [2025-03-08 22:05:42,515 INFO L175 Difference]: Start difference. First operand has 929 places, 934 transitions, 1932 flow. Second operand 9 states and 8881 transitions. [2025-03-08 22:05:42,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 975 transitions, 2220 flow [2025-03-08 22:05:42,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 975 transitions, 2215 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:42,524 INFO L231 Difference]: Finished difference. Result has 942 places, 945 transitions, 2021 flow [2025-03-08 22:05:42,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2021, PETRI_PLACES=942, PETRI_TRANSITIONS=945} [2025-03-08 22:05:42,525 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2025-03-08 22:05:42,525 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 945 transitions, 2021 flow [2025-03-08 22:05:42,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 981.375) internal successors, (7851), 8 states have internal predecessors, (7851), 0 states have call successors, (0), 0 states 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:42,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:42,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:05:42,526 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-08 22:05:42,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1977365629, now seen corresponding path program 1 times [2025-03-08 22:05:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986465318] [2025-03-08 22:05:42,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:42,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-08 22:05:42,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-08 22:05:42,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:42,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat