./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/mult-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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/mult-dist.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 c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:24:23,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:24:23,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:24:23,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:24:23,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:24:23,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:24:23,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:24:23,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:24:23,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:24:23,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:24:23,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:24:23,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:24:23,826 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:24:23,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:24:23,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:24:23,826 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:24:23,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:24:23,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:24:23,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:24:23,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:24:23,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:23,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:24:23,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:24:23,828 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:24:23,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:24:23,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:24:23,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:24:23,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:24:23,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:24:23,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:24:23,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:24:23,829 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 -> c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c [2025-03-13 22:24:24,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:24:24,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:24:24,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:24:24,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:24:24,090 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:24:24,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-dist.wvr.c [2025-03-13 22:24:25,268 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703638364/74d413121adc437785595dc221216f5d/FLAGbf70769f2 [2025-03-13 22:24:25,465 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:24:25,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-dist.wvr.c [2025-03-13 22:24:25,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703638364/74d413121adc437785595dc221216f5d/FLAGbf70769f2 [2025-03-13 22:24:25,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703638364/74d413121adc437785595dc221216f5d [2025-03-13 22:24:25,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:24:25,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:24:25,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:25,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:24:25,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:24:25,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675abc18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25, skipping insertion in model container [2025-03-13 22:24:25,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:24:25,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:25,633 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:24:25,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:25,660 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:24:25,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25 WrapperNode [2025-03-13 22:24:25,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:25,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:25,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:24:25,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:24:25,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,681 INFO L138 Inliner]: procedures = 21, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-03-13 22:24:25,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:25,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:24:25,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:24:25,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:24:25,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:24:25,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:24:25,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:24:25,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:24:25,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (1/1) ... [2025-03-13 22:24:25,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:25,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:24:25,724 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-13 22:24:25,726 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-13 22:24:25,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:24:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:24:25,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:24:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:24:25,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:24:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:24:25,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:24:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:24:25,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:24:25,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:24:25,747 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:24:25,820 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:24:25,822 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:24:26,122 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:24:26,123 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:24:26,123 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:24:26,139 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:24:26,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:26 BoogieIcfgContainer [2025-03-13 22:24:26,139 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:24:26,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:24:26,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:24:26,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:24:26,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:24:25" (1/3) ... [2025-03-13 22:24:26,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a434d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:26, skipping insertion in model container [2025-03-13 22:24:26,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:25" (2/3) ... [2025-03-13 22:24:26,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a434d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:26, skipping insertion in model container [2025-03-13 22:24:26,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:26" (3/3) ... [2025-03-13 22:24:26,149 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2025-03-13 22:24:26,161 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:24:26,163 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-dist.wvr.c that has 4 procedures, 165 locations, 1 initial locations, 3 loop locations, and 19 error locations. [2025-03-13 22:24:26,165 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:24:26,247 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:24:26,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 363 flow [2025-03-13 22:24:26,356 INFO L124 PetriNetUnfolderBase]: 7/168 cut-off events. [2025-03-13 22:24:26,358 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:24:26,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 7/168 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 283 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2025-03-13 22:24:26,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 363 flow [2025-03-13 22:24:26,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 151 transitions, 320 flow [2025-03-13 22:24:26,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:24:26,393 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;@3378e235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:24:26,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-13 22:24:26,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:24:26,402 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-13 22:24:26,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:24:26,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:26,403 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] [2025-03-13 22:24:26,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:26,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash -125452776, now seen corresponding path program 1 times [2025-03-13 22:24:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:26,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874152759] [2025-03-13 22:24:26,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:26,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 22:24:26,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 22:24:26,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:26,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:26,563 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-13 22:24:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874152759] [2025-03-13 22:24:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874152759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:26,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983876907] [2025-03-13 22:24:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:26,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:26,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:26,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2025-03-13 22:24:26,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:26,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:26,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2025-03-13 22:24:26,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:26,711 INFO L124 PetriNetUnfolderBase]: 11/226 cut-off events. [2025-03-13 22:24:26,711 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 22:24:26,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 226 events. 11/226 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 766 event pairs, 5 based on Foata normal form. 8/197 useless extension candidates. Maximal degree in co-relation 188. Up to 25 conditions per place. [2025-03-13 22:24:26,716 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-03-13 22:24:26,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 338 flow [2025-03-13 22:24:26,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2025-03-13 22:24:26,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2025-03-13 22:24:26,736 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 320 flow. Second operand 3 states and 470 transitions. [2025-03-13 22:24:26,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 338 flow [2025-03-13 22:24:26,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 326 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:24:26,744 INFO L231 Difference]: Finished difference. Result has 150 places, 147 transitions, 304 flow [2025-03-13 22:24:26,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=150, PETRI_TRANSITIONS=147} [2025-03-13 22:24:26,750 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -5 predicate places. [2025-03-13 22:24:26,750 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 147 transitions, 304 flow [2025-03-13 22:24:26,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:26,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:26,751 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] [2025-03-13 22:24:26,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:24:26,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:26,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1276415367, now seen corresponding path program 1 times [2025-03-13 22:24:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636733414] [2025-03-13 22:24:26,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:26,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:24:26,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:24:26,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:26,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:26,798 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-13 22:24:26,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636733414] [2025-03-13 22:24:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636733414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:26,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399929121] [2025-03-13 22:24:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:26,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:26,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:26,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:26,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:26,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2025-03-13 22:24:26,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 147 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:26,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:26,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2025-03-13 22:24:26,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:26,878 INFO L124 PetriNetUnfolderBase]: 14/229 cut-off events. [2025-03-13 22:24:26,878 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:24:26,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 229 events. 14/229 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 724 event pairs, 7 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 238. Up to 29 conditions per place. [2025-03-13 22:24:26,881 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-03-13 22:24:26,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 328 flow [2025-03-13 22:24:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-03-13 22:24:26,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103313840155945 [2025-03-13 22:24:26,884 INFO L175 Difference]: Start difference. First operand has 150 places, 147 transitions, 304 flow. Second operand 3 states and 467 transitions. [2025-03-13 22:24:26,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 146 transitions, 328 flow [2025-03-13 22:24:26,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 146 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:26,900 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 302 flow [2025-03-13 22:24:26,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2025-03-13 22:24:26,902 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -6 predicate places. [2025-03-13 22:24:26,903 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 302 flow [2025-03-13 22:24:26,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:26,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:26,903 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] [2025-03-13 22:24:26,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:24:26,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:26,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash 314208985, now seen corresponding path program 1 times [2025-03-13 22:24:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:26,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816940111] [2025-03-13 22:24:26,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:26,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:26,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:24:26,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:24:26,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:26,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:26,958 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-13 22:24:26,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816940111] [2025-03-13 22:24:26,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816940111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:26,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:26,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:26,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113291944] [2025-03-13 22:24:26,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:26,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:26,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:26,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:26,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:26,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2025-03-13 22:24:26,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:26,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:26,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2025-03-13 22:24:26,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,040 INFO L124 PetriNetUnfolderBase]: 22/288 cut-off events. [2025-03-13 22:24:27,040 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:24:27,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 288 events. 22/288 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1204 event pairs, 15 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 304. Up to 40 conditions per place. [2025-03-13 22:24:27,042 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-03-13 22:24:27,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 145 transitions, 328 flow [2025-03-13 22:24:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-03-13 22:24:27,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9064327485380117 [2025-03-13 22:24:27,045 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 302 flow. Second operand 3 states and 465 transitions. [2025-03-13 22:24:27,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 145 transitions, 328 flow [2025-03-13 22:24:27,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:27,048 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 300 flow [2025-03-13 22:24:27,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2025-03-13 22:24:27,048 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -7 predicate places. [2025-03-13 22:24:27,048 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 300 flow [2025-03-13 22:24:27,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,050 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] [2025-03-13 22:24:27,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:24:27,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:27,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1456093503, now seen corresponding path program 1 times [2025-03-13 22:24:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750424099] [2025-03-13 22:24:27,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:24:27,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:24:27,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,096 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-13 22:24:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750424099] [2025-03-13 22:24:27,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750424099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255528409] [2025-03-13 22:24:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-03-13 22:24:27,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-03-13 22:24:27,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,158 INFO L124 PetriNetUnfolderBase]: 23/306 cut-off events. [2025-03-13 22:24:27,158 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:24:27,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 306 events. 23/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1265 event pairs, 6 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 319. Up to 41 conditions per place. [2025-03-13 22:24:27,161 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 13 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-03-13 22:24:27,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 147 transitions, 336 flow [2025-03-13 22:24:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2025-03-13 22:24:27,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278752436647173 [2025-03-13 22:24:27,162 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 300 flow. Second operand 3 states and 476 transitions. [2025-03-13 22:24:27,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 147 transitions, 336 flow [2025-03-13 22:24:27,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 147 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:27,165 INFO L231 Difference]: Finished difference. Result has 147 places, 145 transitions, 306 flow [2025-03-13 22:24:27,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=147, PETRI_TRANSITIONS=145} [2025-03-13 22:24:27,168 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -8 predicate places. [2025-03-13 22:24:27,168 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 145 transitions, 306 flow [2025-03-13 22:24:27,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,169 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] [2025-03-13 22:24:27,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:24:27,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:27,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash 688453627, now seen corresponding path program 1 times [2025-03-13 22:24:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907520942] [2025-03-13 22:24:27,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:24:27,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:24:27,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,219 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-13 22:24:27,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907520942] [2025-03-13 22:24:27,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907520942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898191215] [2025-03-13 22:24:27,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-03-13 22:24:27,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-03-13 22:24:27,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,260 INFO L124 PetriNetUnfolderBase]: 16/223 cut-off events. [2025-03-13 22:24:27,260 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:24:27,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 223 events. 16/223 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 733 event pairs, 2 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 191. Up to 14 conditions per place. [2025-03-13 22:24:27,262 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2025-03-13 22:24:27,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 145 transitions, 334 flow [2025-03-13 22:24:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-13 22:24:27,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-03-13 22:24:27,263 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 306 flow. Second operand 3 states and 474 transitions. [2025-03-13 22:24:27,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 145 transitions, 334 flow [2025-03-13 22:24:27,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 145 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:27,266 INFO L231 Difference]: Finished difference. Result has 147 places, 143 transitions, 308 flow [2025-03-13 22:24:27,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=143} [2025-03-13 22:24:27,266 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -8 predicate places. [2025-03-13 22:24:27,266 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 143 transitions, 308 flow [2025-03-13 22:24:27,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:27,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:24:27,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:27,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash 178982236, now seen corresponding path program 1 times [2025-03-13 22:24:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328355808] [2025-03-13 22:24:27,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:24:27,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:24:27,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,325 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-13 22:24:27,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328355808] [2025-03-13 22:24:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328355808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284652962] [2025-03-13 22:24:27,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2025-03-13 22:24:27,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 143 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2025-03-13 22:24:27,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,458 INFO L124 PetriNetUnfolderBase]: 121/974 cut-off events. [2025-03-13 22:24:27,458 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-13 22:24:27,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 974 events. 121/974 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6756 event pairs, 25 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 1015. Up to 166 conditions per place. [2025-03-13 22:24:27,464 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 18 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2025-03-13 22:24:27,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 148 transitions, 365 flow [2025-03-13 22:24:27,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-13 22:24:27,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-03-13 22:24:27,466 INFO L175 Difference]: Start difference. First operand has 147 places, 143 transitions, 308 flow. Second operand 3 states and 474 transitions. [2025-03-13 22:24:27,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 148 transitions, 365 flow [2025-03-13 22:24:27,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 148 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:27,468 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 317 flow [2025-03-13 22:24:27,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2025-03-13 22:24:27,469 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2025-03-13 22:24:27,469 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 317 flow [2025-03-13 22:24:27,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:27,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:24:27,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:27,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1293271331, now seen corresponding path program 1 times [2025-03-13 22:24:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607487378] [2025-03-13 22:24:27,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 22:24:27,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 22:24:27,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,513 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-13 22:24:27,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607487378] [2025-03-13 22:24:27,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607487378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769951858] [2025-03-13 22:24:27,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-03-13 22:24:27,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-03-13 22:24:27,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][113], [69#L41-6true, 116#L74-1true, Black: 193#true, 44#L49-5true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), 127#L57-6true, Black: 186#true, 188#(= |#race~a~0| 0)]) [2025-03-13 22:24:27,595 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-13 22:24:27,595 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 22:24:27,595 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 22:24:27,596 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 22:24:27,614 INFO L124 PetriNetUnfolderBase]: 131/907 cut-off events. [2025-03-13 22:24:27,614 INFO L125 PetriNetUnfolderBase]: For 29/40 co-relation queries the response was YES. [2025-03-13 22:24:27,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 907 events. 131/907 cut-off events. For 29/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6415 event pairs, 40 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 919. Up to 151 conditions per place. [2025-03-13 22:24:27,621 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 13 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-03-13 22:24:27,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 145 transitions, 353 flow [2025-03-13 22:24:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2025-03-13 22:24:27,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278752436647173 [2025-03-13 22:24:27,623 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 317 flow. Second operand 3 states and 476 transitions. [2025-03-13 22:24:27,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 145 transitions, 353 flow [2025-03-13 22:24:27,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 145 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:27,625 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 327 flow [2025-03-13 22:24:27,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-03-13 22:24:27,627 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2025-03-13 22:24:27,627 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 327 flow [2025-03-13 22:24:27,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,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] [2025-03-13 22:24:27,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:24:27,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1989238983, now seen corresponding path program 1 times [2025-03-13 22:24:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965982635] [2025-03-13 22:24:27,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 22:24:27,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 22:24:27,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,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-13 22:24:27,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965982635] [2025-03-13 22:24:27,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965982635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305105400] [2025-03-13 22:24:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-03-13 22:24:27,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-03-13 22:24:27,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][101], [69#L41-6true, 116#L74-1true, 201#true, Black: 193#true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, 46#L49-6true, 127#L57-6true, Black: 186#true, 188#(= |#race~a~0| 0)]) [2025-03-13 22:24:27,728 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-13 22:24:27,729 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:27,729 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-13 22:24:27,729 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:27,739 INFO L124 PetriNetUnfolderBase]: 73/543 cut-off events. [2025-03-13 22:24:27,739 INFO L125 PetriNetUnfolderBase]: For 15/19 co-relation queries the response was YES. [2025-03-13 22:24:27,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 543 events. 73/543 cut-off events. For 15/19 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3036 event pairs, 10 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 562. Up to 42 conditions per place. [2025-03-13 22:24:27,743 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-03-13 22:24:27,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 143 transitions, 355 flow [2025-03-13 22:24:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-13 22:24:27,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-03-13 22:24:27,744 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 327 flow. Second operand 3 states and 474 transitions. [2025-03-13 22:24:27,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 143 transitions, 355 flow [2025-03-13 22:24:27,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 143 transitions, 355 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:27,746 INFO L231 Difference]: Finished difference. Result has 146 places, 141 transitions, 329 flow [2025-03-13 22:24:27,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=146, PETRI_TRANSITIONS=141} [2025-03-13 22:24:27,749 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2025-03-13 22:24:27,750 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 141 transitions, 329 flow [2025-03-13 22:24:27,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:27,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:24:27,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:27,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2047161438, now seen corresponding path program 1 times [2025-03-13 22:24:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993186858] [2025-03-13 22:24:27,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 22:24:27,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 22:24:27,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,786 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-13 22:24:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993186858] [2025-03-13 22:24:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993186858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325611852] [2025-03-13 22:24:27,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-03-13 22:24:27,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 141 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-03-13 22:24:27,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][100], [69#L41-6true, 201#true, 116#L74-1true, Black: 193#true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, 46#L49-6true, 127#L57-6true, Black: 186#true, 204#true, 188#(= |#race~a~0| 0)]) [2025-03-13 22:24:27,837 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-13 22:24:27,837 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:27,837 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:27,837 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-13 22:24:27,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([365] L49-1-->L49-6: Formula: (= |v_#race~b~0_3| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_3|} AuxVars[] AssignedVars[#race~b~0][104], [69#L41-6true, 116#L74-1true, 201#true, Black: 193#true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, 46#L49-6true, 127#L57-6true, Black: 186#true, 204#true, 188#(= |#race~a~0| 0)]) [2025-03-13 22:24:27,842 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-13 22:24:27,843 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:27,843 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-13 22:24:27,843 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:27,845 INFO L124 PetriNetUnfolderBase]: 64/524 cut-off events. [2025-03-13 22:24:27,845 INFO L125 PetriNetUnfolderBase]: For 4/14 co-relation queries the response was YES. [2025-03-13 22:24:27,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 524 events. 64/524 cut-off events. For 4/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2926 event pairs, 13 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 520. Up to 40 conditions per place. [2025-03-13 22:24:27,849 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-03-13 22:24:27,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 361 flow [2025-03-13 22:24:27,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-13 22:24:27,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-03-13 22:24:27,851 INFO L175 Difference]: Start difference. First operand has 146 places, 141 transitions, 329 flow. Second operand 3 states and 474 transitions. [2025-03-13 22:24:27,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 361 flow [2025-03-13 22:24:27,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 142 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:27,853 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 325 flow [2025-03-13 22:24:27,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2025-03-13 22:24:27,854 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2025-03-13 22:24:27,854 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 325 flow [2025-03-13 22:24:27,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,854 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] [2025-03-13 22:24:27,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:24:27,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:27,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1760333532, now seen corresponding path program 1 times [2025-03-13 22:24:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129823391] [2025-03-13 22:24:27,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 22:24:27,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 22:24:27,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,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-13 22:24:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129823391] [2025-03-13 22:24:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129823391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311379372] [2025-03-13 22:24:27,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-03-13 22:24:27,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-03-13 22:24:27,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][99], [69#L41-6true, 116#L74-1true, Black: 193#true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, 46#L49-6true, 207#true, 127#L57-6true, Black: 186#true, 204#true, 188#(= |#race~a~0| 0)]) [2025-03-13 22:24:27,931 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-13 22:24:27,931 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:27,931 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:27,931 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-13 22:24:27,939 INFO L124 PetriNetUnfolderBase]: 81/541 cut-off events. [2025-03-13 22:24:27,940 INFO L125 PetriNetUnfolderBase]: For 20/23 co-relation queries the response was YES. [2025-03-13 22:24:27,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 541 events. 81/541 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3027 event pairs, 19 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 656. Up to 59 conditions per place. [2025-03-13 22:24:27,943 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-03-13 22:24:27,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 141 transitions, 357 flow [2025-03-13 22:24:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-03-13 22:24:27,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-03-13 22:24:27,945 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 325 flow. Second operand 3 states and 474 transitions. [2025-03-13 22:24:27,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 141 transitions, 357 flow [2025-03-13 22:24:27,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:27,947 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 323 flow [2025-03-13 22:24:27,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2025-03-13 22:24:27,947 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -11 predicate places. [2025-03-13 22:24:27,948 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 323 flow [2025-03-13 22:24:27,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:27,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:24:27,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:27,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1121642942, now seen corresponding path program 1 times [2025-03-13 22:24:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771034015] [2025-03-13 22:24:27,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:24:27,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:24:27,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,985 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-13 22:24:27,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771034015] [2025-03-13 22:24:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771034015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028038375] [2025-03-13 22:24:27,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-03-13 22:24:27,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-03-13 22:24:27,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:28,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][99], [69#L41-6true, 116#L74-1true, Black: 193#true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, 210#true, 207#true, 46#L49-6true, 127#L57-6true, Black: 186#true, 188#(= |#race~a~0| 0)]) [2025-03-13 22:24:28,047 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-13 22:24:28,047 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:28,047 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-13 22:24:28,047 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:28,054 INFO L124 PetriNetUnfolderBase]: 65/459 cut-off events. [2025-03-13 22:24:28,054 INFO L125 PetriNetUnfolderBase]: For 17/21 co-relation queries the response was YES. [2025-03-13 22:24:28,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 459 events. 65/459 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2387 event pairs, 8 based on Foata normal form. 2/427 useless extension candidates. Maximal degree in co-relation 522. Up to 46 conditions per place. [2025-03-13 22:24:28,056 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 8 selfloop transitions, 2 changer transitions 6/139 dead transitions. [2025-03-13 22:24:28,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 349 flow [2025-03-13 22:24:28,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-13 22:24:28,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9220272904483431 [2025-03-13 22:24:28,058 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 323 flow. Second operand 3 states and 473 transitions. [2025-03-13 22:24:28,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 139 transitions, 349 flow [2025-03-13 22:24:28,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:28,061 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 306 flow [2025-03-13 22:24:28,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2025-03-13 22:24:28,062 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -13 predicate places. [2025-03-13 22:24:28,062 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 306 flow [2025-03-13 22:24:28,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:28,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:28,062 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] [2025-03-13 22:24:28,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:24:28,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-13 22:24:28,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:28,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1863799291, now seen corresponding path program 1 times [2025-03-13 22:24:28,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:28,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988871717] [2025-03-13 22:24:28,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:28,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:28,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 22:24:28,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 22:24:28,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:28,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:28,107 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-13 22:24:28,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988871717] [2025-03-13 22:24:28,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988871717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:28,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:28,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674295426] [2025-03-13 22:24:28,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:28,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:28,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:28,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:28,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:28,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-03-13 22:24:28,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:28,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:28,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-03-13 22:24:28,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:28,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L57-8-->L57-6: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][99], [69#L41-6true, 116#L74-1true, Black: 193#true, 195#(= |#race~c~0| 0), 199#(= |#race~b~0| 0), Black: 197#true, 210#true, 213#true, 46#L49-6true, 127#L57-6true, Black: 186#true, 188#(= |#race~a~0| 0)]) [2025-03-13 22:24:28,155 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-13 22:24:28,155 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:28,155 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:24:28,155 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-13 22:24:28,164 INFO L124 PetriNetUnfolderBase]: 72/483 cut-off events. [2025-03-13 22:24:28,165 INFO L125 PetriNetUnfolderBase]: For 41/45 co-relation queries the response was YES. [2025-03-13 22:24:28,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 483 events. 72/483 cut-off events. For 41/45 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2419 event pairs, 18 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 527. Up to 62 conditions per place. [2025-03-13 22:24:28,167 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 0 selfloop transitions, 0 changer transitions 132/132 dead transitions. [2025-03-13 22:24:28,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 132 transitions, 334 flow [2025-03-13 22:24:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-03-13 22:24:28,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9200779727095516 [2025-03-13 22:24:28,168 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 306 flow. Second operand 3 states and 472 transitions. [2025-03-13 22:24:28,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 132 transitions, 334 flow [2025-03-13 22:24:28,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:28,171 INFO L231 Difference]: Finished difference. Result has 135 places, 0 transitions, 0 flow [2025-03-13 22:24:28,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=135, PETRI_TRANSITIONS=0} [2025-03-13 22:24:28,172 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -20 predicate places. [2025-03-13 22:24:28,172 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 0 transitions, 0 flow [2025-03-13 22:24:28,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:28,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2025-03-13 22:24:28,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-03-13 22:24:28,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-03-13 22:24:28,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-03-13 22:24:28,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-03-13 22:24:28,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-03-13 22:24:28,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-03-13 22:24:28,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-03-13 22:24:28,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-03-13 22:24:28,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-03-13 22:24:28,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-03-13 22:24:28,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-03-13 22:24:28,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-03-13 22:24:28,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:24:28,177 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:28,182 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:24:28,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:24:28,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:24:28 BasicIcfg [2025-03-13 22:24:28,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:24:28,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:24:28,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:24:28,188 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:24:28,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:26" (3/4) ... [2025-03-13 22:24:28,189 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:24:28,192 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:24:28,192 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:24:28,192 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 22:24:28,198 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-13 22:24:28,198 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:24:28,198 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:24:28,198 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:24:28,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:24:28,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:24:28,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:24:28,249 INFO L158 Benchmark]: Toolchain (without parser) took 2756.73ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 84.8MB in the end (delta: 38.3MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2025-03-13 22:24:28,249 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:24:28,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.13ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 111.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:24:28,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.29ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:24:28,249 INFO L158 Benchmark]: Boogie Preprocessor took 11.00ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.0MB in the end (delta: 913.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:24:28,250 INFO L158 Benchmark]: IcfgBuilder took 446.67ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 92.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:24:28,250 INFO L158 Benchmark]: TraceAbstraction took 2045.15ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 91.1MB in the end (delta: 729.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:24:28,250 INFO L158 Benchmark]: Witness Printer took 60.42ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 84.8MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:24:28,251 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.24ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.13ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 111.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.29ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.00ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.0MB in the end (delta: 913.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 446.67ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 92.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2045.15ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 91.1MB in the end (delta: 729.3kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.42ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 84.8MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 79]: 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, 246 locations, 35 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: 1.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 65 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=8, InterpolantAutomatonStates: 36, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:24:28,261 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