./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.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/popl20-more-sorted.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 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:07:45,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:07:45,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:07:45,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:07:45,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:07:45,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:07:45,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:07:45,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:07:45,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:07:45,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:07:45,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:07:45,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:07:45,898 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:07:45,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:07:45,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:07:45,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:45,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:07:45,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:07:45,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:07:45,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:07:45,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:07:45,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:07:45,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:07:45,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:07:45,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:07:45,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:07:45,900 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2025-03-08 22:07:46,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:07:46,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:07:46,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:07:46,150 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:07:46,151 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:07:46,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-08 22:07:47,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a56f14e6/456616b3d0f747a6b34e847219ef99cd/FLAG33f976c64 [2025-03-08 22:07:47,583 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:07:47,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-08 22:07:47,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a56f14e6/456616b3d0f747a6b34e847219ef99cd/FLAG33f976c64 [2025-03-08 22:07:47,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a56f14e6/456616b3d0f747a6b34e847219ef99cd [2025-03-08 22:07:47,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:07:47,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:07:47,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:47,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:07:47,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:07:47,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:47" (1/1) ... [2025-03-08 22:07:47,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579d143b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:47, skipping insertion in model container [2025-03-08 22:07:47,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:47" (1/1) ... [2025-03-08 22:07:47,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:07:48,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:48,075 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:07:48,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:48,112 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:07:48,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48 WrapperNode [2025-03-08 22:07:48,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:48,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:48,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:07:48,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:07:48,120 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:07:48" (1/1) ... [2025-03-08 22:07:48,126 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:07:48" (1/1) ... [2025-03-08 22:07:48,139 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-08 22:07:48,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:48,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:07:48,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:07:48,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:07:48,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (1/1) ... [2025-03-08 22:07:48,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (1/1) ... [2025-03-08 22:07:48,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (1/1) ... [2025-03-08 22:07:48,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (1/1) ... [2025-03-08 22:07:48,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (1/1) ... [2025-03-08 22:07:48,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (1/1) ... [2025-03-08 22:07:48,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (1/1) ... [2025-03-08 22:07:48,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (1/1) ... [2025-03-08 22:07:48,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:07:48,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:07:48,160 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:07:48,160 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:07:48,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (1/1) ... [2025-03-08 22:07:48,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:48,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:07:48,194 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:07:48,196 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:07:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:07:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:07:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:07:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:07:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:07:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:07:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:07:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:07:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:07:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:07:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:07:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:07:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:07:48,219 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:07:48,300 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:07:48,302 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:07:48,739 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:07:48,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:07:48,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:07:48,761 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:07:48,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:48 BoogieIcfgContainer [2025-03-08 22:07:48,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:07:48,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:07:48,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:07:48,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:07:48,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:47" (1/3) ... [2025-03-08 22:07:48,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6848dedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:48, skipping insertion in model container [2025-03-08 22:07:48,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:48" (2/3) ... [2025-03-08 22:07:48,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6848dedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:48, skipping insertion in model container [2025-03-08 22:07:48,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:48" (3/3) ... [2025-03-08 22:07:48,770 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2025-03-08 22:07:48,782 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:07:48,784 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sorted.wvr.c that has 4 procedures, 323 locations, 1 initial locations, 4 loop locations, and 36 error locations. [2025-03-08 22:07:48,785 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:07:48,905 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:07:48,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 338 transitions, 697 flow [2025-03-08 22:07:49,064 INFO L124 PetriNetUnfolderBase]: 16/335 cut-off events. [2025-03-08 22:07:49,066 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:07:49,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 335 events. 16/335 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 727 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2025-03-08 22:07:49,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 338 transitions, 697 flow [2025-03-08 22:07:49,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 315 transitions, 648 flow [2025-03-08 22:07:49,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:07:49,099 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;@25143ff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:07:49,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-08 22:07:49,105 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:07:49,106 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-08 22:07:49,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:07:49,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:49,107 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] [2025-03-08 22:07:49,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:49,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash 440160046, now seen corresponding path program 1 times [2025-03-08 22:07:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:49,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103274125] [2025-03-08 22:07:49,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:49,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:07:49,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:07:49,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:49,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:49,240 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:07:49,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:49,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103274125] [2025-03-08 22:07:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103274125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:49,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:49,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967995796] [2025-03-08 22:07:49,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:49,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:49,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:49,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:49,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:49,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 338 [2025-03-08 22:07:49,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 315 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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:07:49,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:49,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 338 [2025-03-08 22:07:49,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:49,435 INFO L124 PetriNetUnfolderBase]: 28/613 cut-off events. [2025-03-08 22:07:49,435 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-08 22:07:49,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 613 events. 28/613 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2734 event pairs, 7 based on Foata normal form. 15/523 useless extension candidates. Maximal degree in co-relation 439. Up to 31 conditions per place. [2025-03-08 22:07:49,447 INFO L140 encePairwiseOnDemand]: 329/338 looper letters, 13 selfloop transitions, 2 changer transitions 3/308 dead transitions. [2025-03-08 22:07:49,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 664 flow [2025-03-08 22:07:49,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2025-03-08 22:07:49,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477317554240631 [2025-03-08 22:07:49,465 INFO L175 Difference]: Start difference. First operand has 311 places, 315 transitions, 648 flow. Second operand 3 states and 961 transitions. [2025-03-08 22:07:49,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 664 flow [2025-03-08 22:07:49,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 308 transitions, 652 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:07:49,477 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 620 flow [2025-03-08 22:07:49,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2025-03-08 22:07:49,483 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -5 predicate places. [2025-03-08 22:07:49,484 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 620 flow [2025-03-08 22:07:49,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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:07:49,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:49,484 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] [2025-03-08 22:07:49,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:07:49,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:49,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash -455694319, now seen corresponding path program 1 times [2025-03-08 22:07:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832836611] [2025-03-08 22:07:49,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:49,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:07:49,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:07:49,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:49,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:49,515 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:07:49,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:49,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832836611] [2025-03-08 22:07:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832836611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:49,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:49,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:49,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488727557] [2025-03-08 22:07:49,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:49,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:49,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:49,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:49,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 338 [2025-03-08 22:07:49,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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:07:49,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:49,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 338 [2025-03-08 22:07:49,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:49,632 INFO L124 PetriNetUnfolderBase]: 19/455 cut-off events. [2025-03-08 22:07:49,633 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:07:49,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 455 events. 19/455 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1763 event pairs, 5 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 462. Up to 27 conditions per place. [2025-03-08 22:07:49,638 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 13 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-03-08 22:07:49,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 304 transitions, 648 flow [2025-03-08 22:07:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2025-03-08 22:07:49,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9418145956607495 [2025-03-08 22:07:49,641 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 620 flow. Second operand 3 states and 955 transitions. [2025-03-08 22:07:49,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 304 transitions, 648 flow [2025-03-08 22:07:49,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 304 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:49,649 INFO L231 Difference]: Finished difference. Result has 302 places, 304 transitions, 618 flow [2025-03-08 22:07:49,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=302, PETRI_TRANSITIONS=304} [2025-03-08 22:07:49,650 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -9 predicate places. [2025-03-08 22:07:49,650 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 304 transitions, 618 flow [2025-03-08 22:07:49,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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:07:49,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:49,650 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:07:49,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:07:49,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:49,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:49,651 INFO L85 PathProgramCache]: Analyzing trace with hash -888676075, now seen corresponding path program 1 times [2025-03-08 22:07:49,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:49,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385652024] [2025-03-08 22:07:49,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:49,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:49,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:07:49,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:07:49,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:49,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:49,690 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:07:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:49,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385652024] [2025-03-08 22:07:49,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385652024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:49,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:49,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299185909] [2025-03-08 22:07:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:49,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:49,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:49,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:49,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:49,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-08 22:07:49,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 304 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states 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:07:49,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:49,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-08 22:07:49,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:49,788 INFO L124 PetriNetUnfolderBase]: 34/596 cut-off events. [2025-03-08 22:07:49,788 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 22:07:49,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 596 events. 34/596 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2832 event pairs, 12 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 616. Up to 46 conditions per place. [2025-03-08 22:07:49,809 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 14 selfloop transitions, 1 changer transitions 0/300 dead transitions. [2025-03-08 22:07:49,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 300 transitions, 640 flow [2025-03-08 22:07:49,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-08 22:07:49,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9388560157790927 [2025-03-08 22:07:49,811 INFO L175 Difference]: Start difference. First operand has 302 places, 304 transitions, 618 flow. Second operand 3 states and 952 transitions. [2025-03-08 22:07:49,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 300 transitions, 640 flow [2025-03-08 22:07:49,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 300 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:49,818 INFO L231 Difference]: Finished difference. Result has 298 places, 300 transitions, 608 flow [2025-03-08 22:07:49,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=298, PETRI_TRANSITIONS=300} [2025-03-08 22:07:49,819 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -13 predicate places. [2025-03-08 22:07:49,820 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 300 transitions, 608 flow [2025-03-08 22:07:49,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states 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:07:49,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:49,820 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] [2025-03-08 22:07:49,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:07:49,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:49,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2139561386, now seen corresponding path program 1 times [2025-03-08 22:07:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729996100] [2025-03-08 22:07:49,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:49,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:07:49,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:07:49,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:49,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:50,436 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:07:50,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729996100] [2025-03-08 22:07:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729996100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:50,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044032806] [2025-03-08 22:07:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:50,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:50,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:50,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:50,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 338 [2025-03-08 22:07:50,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 300 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states 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:07:50,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:50,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 338 [2025-03-08 22:07:50,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:51,754 INFO L124 PetriNetUnfolderBase]: 2073/9422 cut-off events. [2025-03-08 22:07:51,754 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-03-08 22:07:51,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12325 conditions, 9422 events. 2073/9422 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 101554 event pairs, 1520 based on Foata normal form. 0/7729 useless extension candidates. Maximal degree in co-relation 12287. Up to 2804 conditions per place. [2025-03-08 22:07:51,835 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 38 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-03-08 22:07:51,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 299 transitions, 692 flow [2025-03-08 22:07:51,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1760 transitions. [2025-03-08 22:07:51,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8678500986193294 [2025-03-08 22:07:51,840 INFO L175 Difference]: Start difference. First operand has 298 places, 300 transitions, 608 flow. Second operand 6 states and 1760 transitions. [2025-03-08 22:07:51,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 299 transitions, 692 flow [2025-03-08 22:07:51,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 299 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:51,844 INFO L231 Difference]: Finished difference. Result has 301 places, 299 transitions, 615 flow [2025-03-08 22:07:51,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2025-03-08 22:07:51,845 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -10 predicate places. [2025-03-08 22:07:51,845 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 615 flow [2025-03-08 22:07:51,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states 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:07:51,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:51,846 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] [2025-03-08 22:07:51,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:07:51,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:51,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:51,847 INFO L85 PathProgramCache]: Analyzing trace with hash -430454037, now seen corresponding path program 1 times [2025-03-08 22:07:51,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830017198] [2025-03-08 22:07:51,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:51,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:07:51,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:07:51,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:51,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830017198] [2025-03-08 22:07:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830017198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:51,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:51,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362941522] [2025-03-08 22:07:51,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:51,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:51,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:51,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:51,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-08 22:07:51,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states 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:07:51,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:51,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-08 22:07:51,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:52,032 INFO L124 PetriNetUnfolderBase]: 84/906 cut-off events. [2025-03-08 22:07:52,032 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-08 22:07:52,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 906 events. 84/906 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5327 event pairs, 56 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 1023. Up to 112 conditions per place. [2025-03-08 22:07:52,037 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 15 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2025-03-08 22:07:52,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 298 transitions, 647 flow [2025-03-08 22:07:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-03-08 22:07:52,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9378698224852071 [2025-03-08 22:07:52,039 INFO L175 Difference]: Start difference. First operand has 301 places, 299 transitions, 615 flow. Second operand 3 states and 951 transitions. [2025-03-08 22:07:52,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 298 transitions, 647 flow [2025-03-08 22:07:52,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 298 transitions, 637 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:07:52,042 INFO L231 Difference]: Finished difference. Result has 297 places, 298 transitions, 607 flow [2025-03-08 22:07:52,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=297, PETRI_TRANSITIONS=298} [2025-03-08 22:07:52,043 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -14 predicate places. [2025-03-08 22:07:52,043 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 298 transitions, 607 flow [2025-03-08 22:07:52,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states 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:07:52,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:52,043 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:07:52,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:07:52,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:52,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash 93779736, now seen corresponding path program 1 times [2025-03-08 22:07:52,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:52,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219590119] [2025-03-08 22:07:52,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:52,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:07:52,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:07:52,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:52,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:52,073 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:07:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219590119] [2025-03-08 22:07:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219590119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:52,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084737774] [2025-03-08 22:07:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:52,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:52,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:52,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:52,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 338 [2025-03-08 22:07:52,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 298 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states 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:07:52,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:52,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 338 [2025-03-08 22:07:52,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:52,134 INFO L124 PetriNetUnfolderBase]: 17/396 cut-off events. [2025-03-08 22:07:52,134 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:07:52,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 396 events. 17/396 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1394 event pairs, 4 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 395. Up to 24 conditions per place. [2025-03-08 22:07:52,136 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 12 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2025-03-08 22:07:52,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 633 flow [2025-03-08 22:07:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-08 22:07:52,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437869822485208 [2025-03-08 22:07:52,138 INFO L175 Difference]: Start difference. First operand has 297 places, 298 transitions, 607 flow. Second operand 3 states and 957 transitions. [2025-03-08 22:07:52,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 633 flow [2025-03-08 22:07:52,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 297 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:52,141 INFO L231 Difference]: Finished difference. Result has 296 places, 297 transitions, 605 flow [2025-03-08 22:07:52,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=296, PETRI_TRANSITIONS=297} [2025-03-08 22:07:52,142 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -15 predicate places. [2025-03-08 22:07:52,142 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 297 transitions, 605 flow [2025-03-08 22:07:52,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states 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:07:52,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:52,143 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] [2025-03-08 22:07:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:07:52,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:52,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -970218003, now seen corresponding path program 1 times [2025-03-08 22:07:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765975023] [2025-03-08 22:07:52,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:52,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 22:07:52,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 22:07:52,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:52,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:52,184 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:07:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:52,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765975023] [2025-03-08 22:07:52,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765975023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:52,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:52,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138134214] [2025-03-08 22:07:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:52,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:52,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:52,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:52,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 338 [2025-03-08 22:07:52,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 297 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states 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:07:52,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:52,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 338 [2025-03-08 22:07:52,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:52,241 INFO L124 PetriNetUnfolderBase]: 17/397 cut-off events. [2025-03-08 22:07:52,241 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:07:52,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 397 events. 17/397 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1295 event pairs, 4 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 394. Up to 24 conditions per place. [2025-03-08 22:07:52,246 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2025-03-08 22:07:52,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 631 flow [2025-03-08 22:07:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-08 22:07:52,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437869822485208 [2025-03-08 22:07:52,248 INFO L175 Difference]: Start difference. First operand has 296 places, 297 transitions, 605 flow. Second operand 3 states and 957 transitions. [2025-03-08 22:07:52,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 631 flow [2025-03-08 22:07:52,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:52,251 INFO L231 Difference]: Finished difference. Result has 295 places, 296 transitions, 603 flow [2025-03-08 22:07:52,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=295, PETRI_TRANSITIONS=296} [2025-03-08 22:07:52,252 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -16 predicate places. [2025-03-08 22:07:52,252 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 296 transitions, 603 flow [2025-03-08 22:07:52,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states 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:07:52,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:52,252 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] [2025-03-08 22:07:52,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:07:52,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:52,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1726167347, now seen corresponding path program 1 times [2025-03-08 22:07:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37832579] [2025-03-08 22:07:52,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:52,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 22:07:52,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 22:07:52,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:52,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:52,278 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:07:52,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:52,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37832579] [2025-03-08 22:07:52,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37832579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:52,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:52,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816144023] [2025-03-08 22:07:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:52,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:52,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:52,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:52,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:52,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 338 [2025-03-08 22:07:52,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 296 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states 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:07:52,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:52,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 338 [2025-03-08 22:07:52,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:52,323 INFO L124 PetriNetUnfolderBase]: 12/303 cut-off events. [2025-03-08 22:07:52,323 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:07:52,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 303 events. 12/303 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 735 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 295. Up to 21 conditions per place. [2025-03-08 22:07:52,325 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 12 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2025-03-08 22:07:52,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 295 transitions, 629 flow [2025-03-08 22:07:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-08 22:07:52,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437869822485208 [2025-03-08 22:07:52,330 INFO L175 Difference]: Start difference. First operand has 295 places, 296 transitions, 603 flow. Second operand 3 states and 957 transitions. [2025-03-08 22:07:52,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 295 transitions, 629 flow [2025-03-08 22:07:52,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 295 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:52,333 INFO L231 Difference]: Finished difference. Result has 294 places, 295 transitions, 601 flow [2025-03-08 22:07:52,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=294, PETRI_TRANSITIONS=295} [2025-03-08 22:07:52,334 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2025-03-08 22:07:52,334 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 295 transitions, 601 flow [2025-03-08 22:07:52,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states 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:07:52,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:52,334 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] [2025-03-08 22:07:52,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:07:52,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:52,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash -607405341, now seen corresponding path program 1 times [2025-03-08 22:07:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:52,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409135418] [2025-03-08 22:07:52,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:52,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 22:07:52,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 22:07:52,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:52,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:52,371 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:07:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:52,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409135418] [2025-03-08 22:07:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409135418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:52,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299109023] [2025-03-08 22:07:52,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:52,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:52,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:52,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:52,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-08 22:07:52,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 295 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states 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:07:52,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:52,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-08 22:07:52,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:52,505 INFO L124 PetriNetUnfolderBase]: 49/747 cut-off events. [2025-03-08 22:07:52,505 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-08 22:07:52,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 747 events. 49/747 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4086 event pairs, 20 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 776. Up to 56 conditions per place. [2025-03-08 22:07:52,509 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 14 selfloop transitions, 1 changer transitions 0/291 dead transitions. [2025-03-08 22:07:52,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 291 transitions, 623 flow [2025-03-08 22:07:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-08 22:07:52,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9388560157790927 [2025-03-08 22:07:52,512 INFO L175 Difference]: Start difference. First operand has 294 places, 295 transitions, 601 flow. Second operand 3 states and 952 transitions. [2025-03-08 22:07:52,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 291 transitions, 623 flow [2025-03-08 22:07:52,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 291 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:52,515 INFO L231 Difference]: Finished difference. Result has 290 places, 291 transitions, 591 flow [2025-03-08 22:07:52,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=290, PETRI_TRANSITIONS=291} [2025-03-08 22:07:52,516 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-08 22:07:52,517 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 291 transitions, 591 flow [2025-03-08 22:07:52,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states 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:07:52,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:52,517 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] [2025-03-08 22:07:52,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:07:52,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:52,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:52,518 INFO L85 PathProgramCache]: Analyzing trace with hash 132914855, now seen corresponding path program 1 times [2025-03-08 22:07:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:52,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664535876] [2025-03-08 22:07:52,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:52,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:52,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 22:07:52,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 22:07:52,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:52,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:52,557 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:07:52,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:52,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664535876] [2025-03-08 22:07:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664535876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:52,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:52,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154464103] [2025-03-08 22:07:52,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:52,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:52,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:52,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:52,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-08 22:07:52,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 291 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:07:52,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:52,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-08 22:07:52,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:52,614 INFO L124 PetriNetUnfolderBase]: 19/388 cut-off events. [2025-03-08 22:07:52,614 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:07:52,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 388 events. 19/388 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1342 event pairs, 2 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 391. Up to 14 conditions per place. [2025-03-08 22:07:52,617 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 11 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2025-03-08 22:07:52,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 291 transitions, 621 flow [2025-03-08 22:07:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-08 22:07:52,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-08 22:07:52,621 INFO L175 Difference]: Start difference. First operand has 290 places, 291 transitions, 591 flow. Second operand 3 states and 964 transitions. [2025-03-08 22:07:52,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 291 transitions, 621 flow [2025-03-08 22:07:52,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 291 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:52,624 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 592 flow [2025-03-08 22:07:52,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2025-03-08 22:07:52,625 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -22 predicate places. [2025-03-08 22:07:52,625 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 592 flow [2025-03-08 22:07:52,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:07:52,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:52,626 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] [2025-03-08 22:07:52,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:07:52,626 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:52,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash -485319862, now seen corresponding path program 1 times [2025-03-08 22:07:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683955506] [2025-03-08 22:07:52,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:52,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 22:07:52,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 22:07:52,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:52,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:52,664 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:07:52,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:52,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683955506] [2025-03-08 22:07:52,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683955506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:52,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:52,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:52,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425221340] [2025-03-08 22:07:52,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:52,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:52,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:52,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:52,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 338 [2025-03-08 22:07:52,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states 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:07:52,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:52,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 338 [2025-03-08 22:07:52,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:52,958 INFO L124 PetriNetUnfolderBase]: 472/3523 cut-off events. [2025-03-08 22:07:52,959 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-08 22:07:52,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 3523 events. 472/3523 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 32455 event pairs, 172 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 4135. Up to 577 conditions per place. [2025-03-08 22:07:52,980 INFO L140 encePairwiseOnDemand]: 329/338 looper letters, 24 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2025-03-08 22:07:52,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 291 transitions, 655 flow [2025-03-08 22:07:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2025-03-08 22:07:52,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9349112426035503 [2025-03-08 22:07:52,982 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 592 flow. Second operand 3 states and 948 transitions. [2025-03-08 22:07:52,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 291 transitions, 655 flow [2025-03-08 22:07:52,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 291 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:52,988 INFO L231 Difference]: Finished difference. Result has 284 places, 286 transitions, 595 flow [2025-03-08 22:07:52,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=284, PETRI_TRANSITIONS=286} [2025-03-08 22:07:52,988 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2025-03-08 22:07:52,989 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 286 transitions, 595 flow [2025-03-08 22:07:52,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states 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:07:52,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:52,989 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] [2025-03-08 22:07:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:07:52,989 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash 560746688, now seen corresponding path program 1 times [2025-03-08 22:07:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408752322] [2025-03-08 22:07:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:52,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 22:07:53,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 22:07:53,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:53,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:53,021 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:07:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:53,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408752322] [2025-03-08 22:07:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408752322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988585526] [2025-03-08 22:07:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:53,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:53,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:53,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-08 22:07:53,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 286 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states 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:07:53,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:53,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-08 22:07:53,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:53,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([831] thread3EXIT-->L91-12: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][266], [253#L91-12true, Black: 368#true, 370#(= |#race~A~0| 0), 372#true, 343#(= |#race~N~0| 0), 364#(= |#race~M~0| 0)]) [2025-03-08 22:07:53,111 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-08 22:07:53,111 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:07:53,112 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:07:53,112 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-08 22:07:53,112 INFO L124 PetriNetUnfolderBase]: 74/827 cut-off events. [2025-03-08 22:07:53,112 INFO L125 PetriNetUnfolderBase]: For 21/42 co-relation queries the response was YES. [2025-03-08 22:07:53,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 827 events. 74/827 cut-off events. For 21/42 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4195 event pairs, 6 based on Foata normal form. 2/741 useless extension candidates. Maximal degree in co-relation 925. Up to 43 conditions per place. [2025-03-08 22:07:53,121 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 11 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2025-03-08 22:07:53,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 286 transitions, 625 flow [2025-03-08 22:07:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-08 22:07:53,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-08 22:07:53,123 INFO L175 Difference]: Start difference. First operand has 284 places, 286 transitions, 595 flow. Second operand 3 states and 964 transitions. [2025-03-08 22:07:53,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 286 transitions, 625 flow [2025-03-08 22:07:53,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 286 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:53,126 INFO L231 Difference]: Finished difference. Result has 284 places, 284 transitions, 597 flow [2025-03-08 22:07:53,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=284, PETRI_TRANSITIONS=284} [2025-03-08 22:07:53,128 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2025-03-08 22:07:53,129 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 284 transitions, 597 flow [2025-03-08 22:07:53,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states 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:07:53,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:53,130 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] [2025-03-08 22:07:53,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:07:53,130 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:53,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1760024398, now seen corresponding path program 1 times [2025-03-08 22:07:53,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:53,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448093260] [2025-03-08 22:07:53,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:53,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 22:07:53,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 22:07:53,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:53,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:53,180 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:07:53,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:53,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448093260] [2025-03-08 22:07:53,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448093260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:53,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:53,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560019555] [2025-03-08 22:07:53,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:53,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:53,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:53,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:53,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-08 22:07:53,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 284 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states 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:07:53,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:53,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-08 22:07:53,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:53,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([831] thread3EXIT-->L91-12: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][265], [253#L91-12true, Black: 368#true, 370#(= |#race~A~0| 0), 372#true, 343#(= |#race~N~0| 0), 364#(= |#race~M~0| 0), 375#true]) [2025-03-08 22:07:53,302 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-08 22:07:53,302 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:07:53,302 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:07:53,302 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-08 22:07:53,302 INFO L124 PetriNetUnfolderBase]: 65/761 cut-off events. [2025-03-08 22:07:53,302 INFO L125 PetriNetUnfolderBase]: For 8/46 co-relation queries the response was YES. [2025-03-08 22:07:53,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 761 events. 65/761 cut-off events. For 8/46 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3656 event pairs, 13 based on Foata normal form. 5/694 useless extension candidates. Maximal degree in co-relation 871. Up to 52 conditions per place. [2025-03-08 22:07:53,310 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 13 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-08 22:07:53,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 285 transitions, 631 flow [2025-03-08 22:07:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-08 22:07:53,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-08 22:07:53,312 INFO L175 Difference]: Start difference. First operand has 284 places, 284 transitions, 597 flow. Second operand 3 states and 964 transitions. [2025-03-08 22:07:53,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 285 transitions, 631 flow [2025-03-08 22:07:53,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 285 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:53,316 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 593 flow [2025-03-08 22:07:53,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2025-03-08 22:07:53,316 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -28 predicate places. [2025-03-08 22:07:53,317 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 593 flow [2025-03-08 22:07:53,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states 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:07:53,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:53,317 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] [2025-03-08 22:07:53,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:07:53,320 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:53,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash 284476688, now seen corresponding path program 1 times [2025-03-08 22:07:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:53,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556839291] [2025-03-08 22:07:53,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:53,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:07:53,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:07:53,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:53,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:53,427 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:07:53,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:53,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556839291] [2025-03-08 22:07:53,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556839291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:53,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:53,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:07:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459389556] [2025-03-08 22:07:53,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:53,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:07:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:53,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:07:53,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:07:53,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-08 22:07:53,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 593 flow. Second operand has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:07:53,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:53,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-08 22:07:53,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:53,786 INFO L124 PetriNetUnfolderBase]: 95/1384 cut-off events. [2025-03-08 22:07:53,786 INFO L125 PetriNetUnfolderBase]: For 11/35 co-relation queries the response was YES. [2025-03-08 22:07:53,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1384 events. 95/1384 cut-off events. For 11/35 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8703 event pairs, 18 based on Foata normal form. 4/1261 useless extension candidates. Maximal degree in co-relation 1565. Up to 71 conditions per place. [2025-03-08 22:07:53,795 INFO L140 encePairwiseOnDemand]: 325/338 looper letters, 22 selfloop transitions, 14 changer transitions 0/298 dead transitions. [2025-03-08 22:07:53,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 298 transitions, 703 flow [2025-03-08 22:07:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:07:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:07:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3127 transitions. [2025-03-08 22:07:53,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9251479289940828 [2025-03-08 22:07:53,799 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 593 flow. Second operand 10 states and 3127 transitions. [2025-03-08 22:07:53,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 298 transitions, 703 flow [2025-03-08 22:07:53,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 298 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:53,803 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 655 flow [2025-03-08 22:07:53,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=655, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2025-03-08 22:07:53,803 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2025-03-08 22:07:53,804 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 655 flow [2025-03-08 22:07:53,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:07:53,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:53,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:53,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:07:53,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:53,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash -593447577, now seen corresponding path program 1 times [2025-03-08 22:07:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304959561] [2025-03-08 22:07:53,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:53,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 22:07:53,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 22:07:53,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:53,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:53,833 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:07:53,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:53,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304959561] [2025-03-08 22:07:53,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304959561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:53,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:53,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352790183] [2025-03-08 22:07:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:53,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:53,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:53,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:53,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-08 22:07:53,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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:07:53,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:53,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-08 22:07:53,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:53,976 INFO L124 PetriNetUnfolderBase]: 136/1346 cut-off events. [2025-03-08 22:07:53,977 INFO L125 PetriNetUnfolderBase]: For 58/95 co-relation queries the response was YES. [2025-03-08 22:07:53,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 1346 events. 136/1346 cut-off events. For 58/95 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8273 event pairs, 28 based on Foata normal form. 3/1224 useless extension candidates. Maximal degree in co-relation 1600. Up to 117 conditions per place. [2025-03-08 22:07:53,992 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 13 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-03-08 22:07:53,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 291 transitions, 689 flow [2025-03-08 22:07:53,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-08 22:07:53,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-08 22:07:53,994 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 655 flow. Second operand 3 states and 964 transitions. [2025-03-08 22:07:53,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 291 transitions, 689 flow [2025-03-08 22:07:53,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 291 transitions, 685 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:53,997 INFO L231 Difference]: Finished difference. Result has 294 places, 289 transitions, 653 flow [2025-03-08 22:07:53,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=294, PETRI_TRANSITIONS=289} [2025-03-08 22:07:53,998 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2025-03-08 22:07:53,998 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 653 flow [2025-03-08 22:07:53,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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:07:53,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:53,999 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] [2025-03-08 22:07:53,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:07:53,999 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:53,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1939721856, now seen corresponding path program 1 times [2025-03-08 22:07:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930728993] [2025-03-08 22:07:53,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:54,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 22:07:54,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 22:07:54,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:54,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:54,027 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:07:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930728993] [2025-03-08 22:07:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930728993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:54,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:54,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470092601] [2025-03-08 22:07:54,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:54,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:54,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:54,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:54,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:54,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-08 22:07:54,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states 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:07:54,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:54,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-08 22:07:54,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:54,149 INFO L124 PetriNetUnfolderBase]: 120/1101 cut-off events. [2025-03-08 22:07:54,149 INFO L125 PetriNetUnfolderBase]: For 59/90 co-relation queries the response was YES. [2025-03-08 22:07:54,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 1101 events. 120/1101 cut-off events. For 59/90 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6240 event pairs, 11 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 1306. Up to 78 conditions per place. [2025-03-08 22:07:54,158 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 9 selfloop transitions, 2 changer transitions 8/289 dead transitions. [2025-03-08 22:07:54,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 681 flow [2025-03-08 22:07:54,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2025-03-08 22:07:54,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497041420118343 [2025-03-08 22:07:54,160 INFO L175 Difference]: Start difference. First operand has 294 places, 289 transitions, 653 flow. Second operand 3 states and 963 transitions. [2025-03-08 22:07:54,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 289 transitions, 681 flow [2025-03-08 22:07:54,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 677 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:54,165 INFO L231 Difference]: Finished difference. Result has 292 places, 279 transitions, 632 flow [2025-03-08 22:07:54,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=292, PETRI_TRANSITIONS=279} [2025-03-08 22:07:54,166 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -19 predicate places. [2025-03-08 22:07:54,166 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 279 transitions, 632 flow [2025-03-08 22:07:54,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states 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:07:54,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:54,166 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] [2025-03-08 22:07:54,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:07:54,167 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:54,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash 579234601, now seen corresponding path program 1 times [2025-03-08 22:07:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:54,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845581324] [2025-03-08 22:07:54,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:54,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 22:07:54,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 22:07:54,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:54,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:54,278 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:07:54,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:54,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845581324] [2025-03-08 22:07:54,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845581324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:54,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:54,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:54,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659032086] [2025-03-08 22:07:54,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:54,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:07:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:54,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:07:54,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:07:54,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-08 22:07:54,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 279 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states 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:07:54,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:54,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-08 22:07:54,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:54,562 INFO L124 PetriNetUnfolderBase]: 133/1669 cut-off events. [2025-03-08 22:07:54,562 INFO L125 PetriNetUnfolderBase]: For 60/70 co-relation queries the response was YES. [2025-03-08 22:07:54,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1669 events. 133/1669 cut-off events. For 60/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11210 event pairs, 40 based on Foata normal form. 8/1545 useless extension candidates. Maximal degree in co-relation 1968. Up to 114 conditions per place. [2025-03-08 22:07:54,582 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 22 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2025-03-08 22:07:54,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 713 flow [2025-03-08 22:07:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:07:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 22:07:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1583 transitions. [2025-03-08 22:07:54,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9366863905325444 [2025-03-08 22:07:54,586 INFO L175 Difference]: Start difference. First operand has 292 places, 279 transitions, 632 flow. Second operand 5 states and 1583 transitions. [2025-03-08 22:07:54,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 713 flow [2025-03-08 22:07:54,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:54,591 INFO L231 Difference]: Finished difference. Result has 288 places, 281 transitions, 653 flow [2025-03-08 22:07:54,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=653, PETRI_PLACES=288, PETRI_TRANSITIONS=281} [2025-03-08 22:07:54,592 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -23 predicate places. [2025-03-08 22:07:54,592 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 281 transitions, 653 flow [2025-03-08 22:07:54,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states 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:07:54,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:54,593 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] [2025-03-08 22:07:54,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:07:54,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:54,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash -103833081, now seen corresponding path program 1 times [2025-03-08 22:07:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830162047] [2025-03-08 22:07:54,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:54,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:54,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 22:07:54,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 22:07:54,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:54,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:54,637 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:07:54,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:54,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830162047] [2025-03-08 22:07:54,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830162047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:54,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:54,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:54,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357811865] [2025-03-08 22:07:54,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:54,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:54,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:54,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:54,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:54,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-08 22:07:54,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 281 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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:07:54,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:54,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-08 22:07:54,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:54,850 INFO L124 PetriNetUnfolderBase]: 233/1746 cut-off events. [2025-03-08 22:07:54,850 INFO L125 PetriNetUnfolderBase]: For 147/218 co-relation queries the response was YES. [2025-03-08 22:07:54,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1746 events. 233/1746 cut-off events. For 147/218 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12325 event pairs, 56 based on Foata normal form. 0/1602 useless extension candidates. Maximal degree in co-relation 2196. Up to 235 conditions per place. [2025-03-08 22:07:54,865 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 11 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-08 22:07:54,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 282 transitions, 683 flow [2025-03-08 22:07:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-08 22:07:54,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2025-03-08 22:07:54,867 INFO L175 Difference]: Start difference. First operand has 288 places, 281 transitions, 653 flow. Second operand 3 states and 962 transitions. [2025-03-08 22:07:54,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 282 transitions, 683 flow [2025-03-08 22:07:54,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 282 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:54,871 INFO L231 Difference]: Finished difference. Result has 287 places, 280 transitions, 650 flow [2025-03-08 22:07:54,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=287, PETRI_TRANSITIONS=280} [2025-03-08 22:07:54,872 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -24 predicate places. [2025-03-08 22:07:54,872 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 280 transitions, 650 flow [2025-03-08 22:07:54,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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:07:54,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:54,873 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] [2025-03-08 22:07:54,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:07:54,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:54,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash -838608705, now seen corresponding path program 1 times [2025-03-08 22:07:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:54,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446933579] [2025-03-08 22:07:54,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:54,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 22:07:54,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 22:07:54,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:54,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:55,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:55,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446933579] [2025-03-08 22:07:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446933579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:55,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863504973] [2025-03-08 22:07:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:55,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:55,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:55,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:55,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-08 22:07:55,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 280 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:07:55,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:55,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-08 22:07:55,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:55,602 INFO L124 PetriNetUnfolderBase]: 151/1753 cut-off events. [2025-03-08 22:07:55,602 INFO L125 PetriNetUnfolderBase]: For 141/150 co-relation queries the response was YES. [2025-03-08 22:07:55,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1753 events. 151/1753 cut-off events. For 141/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11841 event pairs, 37 based on Foata normal form. 0/1636 useless extension candidates. Maximal degree in co-relation 2170. Up to 142 conditions per place. [2025-03-08 22:07:55,620 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 25 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-03-08 22:07:55,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 288 transitions, 734 flow [2025-03-08 22:07:55,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-08 22:07:55,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-08 22:07:55,623 INFO L175 Difference]: Start difference. First operand has 287 places, 280 transitions, 650 flow. Second operand 6 states and 1883 transitions. [2025-03-08 22:07:55,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 288 transitions, 734 flow [2025-03-08 22:07:55,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:55,627 INFO L231 Difference]: Finished difference. Result has 290 places, 280 transitions, 660 flow [2025-03-08 22:07:55,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=290, PETRI_TRANSITIONS=280} [2025-03-08 22:07:55,628 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-08 22:07:55,628 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 280 transitions, 660 flow [2025-03-08 22:07:55,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:07:55,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:55,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:55,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:07:55,629 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:55,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash -12129015, now seen corresponding path program 1 times [2025-03-08 22:07:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:55,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218849472] [2025-03-08 22:07:55,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:55,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 22:07:55,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 22:07:55,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:55,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:55,898 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:07:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:55,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218849472] [2025-03-08 22:07:55,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218849472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:55,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:55,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006840768] [2025-03-08 22:07:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:55,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:55,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:55,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:55,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:56,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-08 22:07:56,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 280 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states 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:07:56,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:56,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-08 22:07:56,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:56,338 INFO L124 PetriNetUnfolderBase]: 232/1738 cut-off events. [2025-03-08 22:07:56,338 INFO L125 PetriNetUnfolderBase]: For 147/268 co-relation queries the response was YES. [2025-03-08 22:07:56,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 1738 events. 232/1738 cut-off events. For 147/268 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12161 event pairs, 52 based on Foata normal form. 4/1628 useless extension candidates. Maximal degree in co-relation 2227. Up to 219 conditions per place. [2025-03-08 22:07:56,353 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 23 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-03-08 22:07:56,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 740 flow [2025-03-08 22:07:56,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-08 22:07:56,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-08 22:07:56,356 INFO L175 Difference]: Start difference. First operand has 290 places, 280 transitions, 660 flow. Second operand 6 states and 1883 transitions. [2025-03-08 22:07:56,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 740 flow [2025-03-08 22:07:56,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 288 transitions, 732 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:07:56,360 INFO L231 Difference]: Finished difference. Result has 291 places, 280 transitions, 666 flow [2025-03-08 22:07:56,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=666, PETRI_PLACES=291, PETRI_TRANSITIONS=280} [2025-03-08 22:07:56,360 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -20 predicate places. [2025-03-08 22:07:56,360 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 280 transitions, 666 flow [2025-03-08 22:07:56,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states 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:07:56,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:56,361 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] [2025-03-08 22:07:56,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:07:56,361 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:56,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:56,362 INFO L85 PathProgramCache]: Analyzing trace with hash -362580254, now seen corresponding path program 1 times [2025-03-08 22:07:56,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:56,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814985490] [2025-03-08 22:07:56,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:56,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:56,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 22:07:56,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 22:07:56,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:56,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:07:56,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814985490] [2025-03-08 22:07:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814985490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:07:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021057696] [2025-03-08 22:07:56,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:56,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:07:56,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:07:56,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:07:56,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:07:56,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 22:07:56,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 22:07:56,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:56,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:56,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:07:56,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:07:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:07:56,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:07:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:07:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021057696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:07:56,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:07:56,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-08 22:07:56,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315328417] [2025-03-08 22:07:56,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:07:56,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:07:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:56,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:07:56,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:07:57,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 338 [2025-03-08 22:07:57,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 280 transitions, 666 flow. Second operand has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 0 states have call successors, (0), 0 states 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:07:57,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:57,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 338 [2025-03-08 22:07:57,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:57,849 INFO L124 PetriNetUnfolderBase]: 208/3310 cut-off events. [2025-03-08 22:07:57,849 INFO L125 PetriNetUnfolderBase]: For 94/118 co-relation queries the response was YES. [2025-03-08 22:07:57,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 3310 events. 208/3310 cut-off events. For 94/118 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 28115 event pairs, 35 based on Foata normal form. 9/3136 useless extension candidates. Maximal degree in co-relation 4077. Up to 108 conditions per place. [2025-03-08 22:07:57,882 INFO L140 encePairwiseOnDemand]: 321/338 looper letters, 26 selfloop transitions, 27 changer transitions 0/302 dead transitions. [2025-03-08 22:07:57,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 838 flow [2025-03-08 22:07:57,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:07:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-08 22:07:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4930 transitions. [2025-03-08 22:07:57,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.911612426035503 [2025-03-08 22:07:57,889 INFO L175 Difference]: Start difference. First operand has 291 places, 280 transitions, 666 flow. Second operand 16 states and 4930 transitions. [2025-03-08 22:07:57,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 838 flow [2025-03-08 22:07:57,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 830 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:07:57,894 INFO L231 Difference]: Finished difference. Result has 310 places, 291 transitions, 797 flow [2025-03-08 22:07:57,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=797, PETRI_PLACES=310, PETRI_TRANSITIONS=291} [2025-03-08 22:07:57,894 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -1 predicate places. [2025-03-08 22:07:57,894 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 291 transitions, 797 flow [2025-03-08 22:07:57,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 0 states have call successors, (0), 0 states 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:07:57,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:57,896 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] [2025-03-08 22:07:57,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:07:58,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 22:07:58,100 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash -986271259, now seen corresponding path program 1 times [2025-03-08 22:07:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:58,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880867967] [2025-03-08 22:07:58,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:58,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 22:07:58,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 22:07:58,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:58,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:58,397 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:07:58,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:58,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880867967] [2025-03-08 22:07:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880867967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:58,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:58,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937972916] [2025-03-08 22:07:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:58,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:58,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:58,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:58,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-08 22:07:58,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 291 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:07:58,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:58,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-08 22:07:58,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:58,923 INFO L124 PetriNetUnfolderBase]: 198/2471 cut-off events. [2025-03-08 22:07:58,923 INFO L125 PetriNetUnfolderBase]: For 285/294 co-relation queries the response was YES. [2025-03-08 22:07:58,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 2471 events. 198/2471 cut-off events. For 285/294 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 18827 event pairs, 51 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 3195. Up to 196 conditions per place. [2025-03-08 22:07:58,944 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 25 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-03-08 22:07:58,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 298 transitions, 879 flow [2025-03-08 22:07:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-08 22:07:58,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-08 22:07:58,947 INFO L175 Difference]: Start difference. First operand has 310 places, 291 transitions, 797 flow. Second operand 6 states and 1883 transitions. [2025-03-08 22:07:58,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 298 transitions, 879 flow [2025-03-08 22:07:58,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 298 transitions, 862 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:58,952 INFO L231 Difference]: Finished difference. Result has 312 places, 290 transitions, 788 flow [2025-03-08 22:07:58,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=312, PETRI_TRANSITIONS=290} [2025-03-08 22:07:58,953 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, 1 predicate places. [2025-03-08 22:07:58,953 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 290 transitions, 788 flow [2025-03-08 22:07:58,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:07:58,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:58,954 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] [2025-03-08 22:07:58,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:07:58,955 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:58,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash 178980527, now seen corresponding path program 1 times [2025-03-08 22:07:58,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:58,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446289699] [2025-03-08 22:07:58,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:58,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:58,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 22:07:58,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 22:07:58,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:58,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:07:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446289699] [2025-03-08 22:07:59,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446289699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:59,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:59,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:59,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728423177] [2025-03-08 22:07:59,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:59,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:59,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:59,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:59,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:59,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-08 22:07:59,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 290 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states 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:07:59,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:59,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-08 22:07:59,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:59,767 INFO L124 PetriNetUnfolderBase]: 310/2227 cut-off events. [2025-03-08 22:07:59,767 INFO L125 PetriNetUnfolderBase]: For 335/504 co-relation queries the response was YES. [2025-03-08 22:07:59,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 2227 events. 310/2227 cut-off events. For 335/504 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 16443 event pairs, 75 based on Foata normal form. 20/2123 useless extension candidates. Maximal degree in co-relation 3081. Up to 307 conditions per place. [2025-03-08 22:07:59,785 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 23 selfloop transitions, 5 changer transitions 13/297 dead transitions. [2025-03-08 22:07:59,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 297 transitions, 866 flow [2025-03-08 22:07:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-08 22:07:59,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-08 22:07:59,787 INFO L175 Difference]: Start difference. First operand has 312 places, 290 transitions, 788 flow. Second operand 6 states and 1883 transitions. [2025-03-08 22:07:59,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 297 transitions, 866 flow [2025-03-08 22:07:59,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 297 transitions, 854 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-08 22:07:59,791 INFO L231 Difference]: Finished difference. Result has 311 places, 276 transitions, 694 flow [2025-03-08 22:07:59,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=311, PETRI_TRANSITIONS=276} [2025-03-08 22:07:59,792 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, 0 predicate places. [2025-03-08 22:07:59,792 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 276 transitions, 694 flow [2025-03-08 22:07:59,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states 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:07:59,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:59,793 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:59,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:07:59,793 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:07:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:59,794 INFO L85 PathProgramCache]: Analyzing trace with hash 725919440, now seen corresponding path program 2 times [2025-03-08 22:07:59,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:59,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209787268] [2025-03-08 22:07:59,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:07:59,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:59,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-08 22:07:59,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 144 statements. [2025-03-08 22:07:59,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:07:59,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 22:08:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209787268] [2025-03-08 22:08:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209787268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:00,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:00,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392871639] [2025-03-08 22:08:00,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:00,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:00,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:00,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:00,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-08 22:08:00,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 276 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states 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:08:00,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:00,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-08 22:08:00,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:00,477 INFO L124 PetriNetUnfolderBase]: 96/1255 cut-off events. [2025-03-08 22:08:00,477 INFO L125 PetriNetUnfolderBase]: For 40/64 co-relation queries the response was YES. [2025-03-08 22:08:00,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1255 events. 96/1255 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7436 event pairs, 21 based on Foata normal form. 8/1214 useless extension candidates. Maximal degree in co-relation 1656. Up to 88 conditions per place. [2025-03-08 22:08:00,491 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 23 selfloop transitions, 5 changer transitions 0/284 dead transitions. [2025-03-08 22:08:00,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 284 transitions, 774 flow [2025-03-08 22:08:00,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-08 22:08:00,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-08 22:08:00,493 INFO L175 Difference]: Start difference. First operand has 311 places, 276 transitions, 694 flow. Second operand 6 states and 1883 transitions. [2025-03-08 22:08:00,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 284 transitions, 774 flow [2025-03-08 22:08:00,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 284 transitions, 722 flow, removed 4 selfloop flow, removed 18 redundant places. [2025-03-08 22:08:00,498 INFO L231 Difference]: Finished difference. Result has 290 places, 276 transitions, 656 flow [2025-03-08 22:08:00,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=656, PETRI_PLACES=290, PETRI_TRANSITIONS=276} [2025-03-08 22:08:00,499 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-08 22:08:00,499 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 276 transitions, 656 flow [2025-03-08 22:08:00,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states 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:08:00,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:00,500 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:08:00,500 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-08 22:08:00,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash -717740554, now seen corresponding path program 1 times [2025-03-08 22:08:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958698142] [2025-03-08 22:08:00,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:00,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 22:08:00,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 22:08:00,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:00,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 22:08:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958698142] [2025-03-08 22:08:00,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958698142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:00,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:00,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:00,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112848129] [2025-03-08 22:08:00,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:00,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:00,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:00,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:00,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:01,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-08 22:08:01,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 276 transitions, 656 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states 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:08:01,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:01,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-08 22:08:01,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:01,216 INFO L124 PetriNetUnfolderBase]: 96/1249 cut-off events. [2025-03-08 22:08:01,216 INFO L125 PetriNetUnfolderBase]: For 33/57 co-relation queries the response was YES. [2025-03-08 22:08:01,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 1249 events. 96/1249 cut-off events. For 33/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7331 event pairs, 21 based on Foata normal form. 8/1202 useless extension candidates. Maximal degree in co-relation 1603. Up to 88 conditions per place. [2025-03-08 22:08:01,228 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 0 selfloop transitions, 0 changer transitions 283/283 dead transitions. [2025-03-08 22:08:01,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 283 transitions, 734 flow [2025-03-08 22:08:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-08 22:08:01,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-08 22:08:01,229 INFO L175 Difference]: Start difference. First operand has 290 places, 276 transitions, 656 flow. Second operand 6 states and 1883 transitions. [2025-03-08 22:08:01,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 283 transitions, 734 flow [2025-03-08 22:08:01,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 283 transitions, 726 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:08:01,232 INFO L231 Difference]: Finished difference. Result has 290 places, 0 transitions, 0 flow [2025-03-08 22:08:01,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=290, PETRI_TRANSITIONS=0} [2025-03-08 22:08:01,233 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-08 22:08:01,233 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 0 transitions, 0 flow [2025-03-08 22:08:01,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states 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:08:01,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (60 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2025-03-08 22:08:01,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2025-03-08 22:08:01,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2025-03-08 22:08:01,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2025-03-08 22:08:01,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:08:01,240 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:01,245 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:08:01,245 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:08:01,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:08:01 BasicIcfg [2025-03-08 22:08:01,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:08:01,252 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:08:01,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:08:01,252 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:08:01,253 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:48" (3/4) ... [2025-03-08 22:08:01,254 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:08:01,256 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:08:01,256 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:08:01,256 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 22:08:01,260 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-08 22:08:01,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:08:01,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:08:01,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:08:01,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:08:01,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:08:01,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:08:01,326 INFO L158 Benchmark]: Toolchain (without parser) took 13400.20ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 112.9MB in the beginning and 78.3MB in the end (delta: 34.6MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2025-03-08 22:08:01,327 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:08:01,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.68ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 100.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:08:01,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.42ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:08:01,327 INFO L158 Benchmark]: Boogie Preprocessor took 19.36ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:08:01,328 INFO L158 Benchmark]: IcfgBuilder took 601.98ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 68.1MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 22:08:01,328 INFO L158 Benchmark]: TraceAbstraction took 12488.41ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 67.6MB in the beginning and 85.4MB in the end (delta: -17.7MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2025-03-08 22:08:01,328 INFO L158 Benchmark]: Witness Printer took 73.14ms. Allocated memory is still 226.5MB. Free memory was 85.4MB in the beginning and 78.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:08:01,329 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.68ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 100.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.42ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.36ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 601.98ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 68.1MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12488.41ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 67.6MB in the beginning and 85.4MB in the end (delta: -17.7MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. * Witness Printer took 73.14ms. Allocated memory is still 226.5MB. Free memory was 85.4MB in the beginning and 78.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 473 locations, 497 edges, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.3s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2585 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1575 mSDsluCounter, 1421 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1211 mSDsCounter, 587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4285 IncrementalHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 587 mSolverCounterUnsat, 210 mSDtfsCounter, 4285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=21, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2631 NumberOfCodeBlocks, 2601 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2733 ConstructedInterpolants, 0 QuantifiedInterpolants, 4644 SizeOfPredicates, 7 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 48/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:08:01,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE