./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/pthread-race-challenges/thread-join-counter-outer-race-2.i -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 d12d10876782f724294e520e736e39c29f3c74eafacabb114f7449f7b8388c75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:00:50,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:00:51,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 07:00:51,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:00:51,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:00:51,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:00:51,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:00:51,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:00:51,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:00:51,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:00:51,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:00:51,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 07:00:51,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:00:51,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:00:51,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:00:51,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:00:51,052 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 -> d12d10876782f724294e520e736e39c29f3c74eafacabb114f7449f7b8388c75 [2025-03-04 07:00:51,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:00:51,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:00:51,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:00:51,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:00:51,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:00:51,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i [2025-03-04 07:00:52,476 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/479017ecc/083360e25b444caba5f41578d50f33d1/FLAG22598f039 [2025-03-04 07:00:52,734 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:00:52,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i [2025-03-04 07:00:52,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/479017ecc/083360e25b444caba5f41578d50f33d1/FLAG22598f039 [2025-03-04 07:00:53,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/479017ecc/083360e25b444caba5f41578d50f33d1 [2025-03-04 07:00:53,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:00:53,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:00:53,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:00:53,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:00:53,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:00:53,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc6147a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53, skipping insertion in model container [2025-03-04 07:00:53,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:00:53,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:00:53,308 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:00:53,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:00:53,367 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:00:53,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53 WrapperNode [2025-03-04 07:00:53,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:00:53,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:00:53,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:00:53,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:00:53,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,410 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-03-04 07:00:53,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:00:53,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:00:53,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:00:53,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:00:53,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:00:53,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:00:53,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:00:53,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:00:53,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (1/1) ... [2025-03-04 07:00:53,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:00:53,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:00:53,463 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-04 07:00:53,466 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-04 07:00:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 07:00:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:00:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 07:00:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 07:00:53,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 07:00:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 07:00:53,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:00:53,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:00:53,481 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 07:00:53,574 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:00:53,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:00:53,837 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 07:00:53,837 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:00:53,870 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:00:53,871 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:00:53,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:00:53 BoogieIcfgContainer [2025-03-04 07:00:53,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:00:53,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:00:53,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:00:53,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:00:53,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:00:53" (1/3) ... [2025-03-04 07:00:53,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75db23d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:00:53, skipping insertion in model container [2025-03-04 07:00:53,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:53" (2/3) ... [2025-03-04 07:00:53,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75db23d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:00:53, skipping insertion in model container [2025-03-04 07:00:53,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:00:53" (3/3) ... [2025-03-04 07:00:53,879 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-2.i [2025-03-04 07:00:53,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:00:53,890 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race-2.i that has 2 procedures, 230 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 07:00:53,891 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 07:00:53,953 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 07:00:53,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 233 transitions, 470 flow [2025-03-04 07:00:54,072 INFO L124 PetriNetUnfolderBase]: 5/274 cut-off events. [2025-03-04 07:00:54,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:00:54,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 5/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 237 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 192. Up to 4 conditions per place. [2025-03-04 07:00:54,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 233 transitions, 470 flow [2025-03-04 07:00:54,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 233 transitions, 470 flow [2025-03-04 07:00:54,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:00:54,094 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;@830faf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:00:54,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 07:00:54,135 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 07:00:54,135 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-04 07:00:54,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:00:54,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:54,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:00:54,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:54,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash 409692617, now seen corresponding path program 1 times [2025-03-04 07:00:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:54,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370188813] [2025-03-04 07:00:54,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:54,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 07:00:54,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 07:00:54,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:54,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:54,466 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-04 07:00:54,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:54,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370188813] [2025-03-04 07:00:54,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370188813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:54,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:54,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:54,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304549558] [2025-03-04 07:00:54,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:54,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:54,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:54,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:54,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-03-04 07:00:54,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 233 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-04 07:00:54,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:54,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-03-04 07:00:54,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:54,767 INFO L124 PetriNetUnfolderBase]: 116/821 cut-off events. [2025-03-04 07:00:54,768 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 07:00:54,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 821 events. 116/821 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4274 event pairs, 37 based on Foata normal form. 1/748 useless extension candidates. Maximal degree in co-relation 880. Up to 144 conditions per place. [2025-03-04 07:00:54,774 INFO L140 encePairwiseOnDemand]: 220/233 looper letters, 32 selfloop transitions, 8 changer transitions 1/249 dead transitions. [2025-03-04 07:00:54,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 249 transitions, 582 flow [2025-03-04 07:00:54,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-03-04 07:00:54,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628040057224606 [2025-03-04 07:00:54,791 INFO L175 Difference]: Start difference. First operand has 233 places, 233 transitions, 470 flow. Second operand 3 states and 673 transitions. [2025-03-04 07:00:54,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 249 transitions, 582 flow [2025-03-04 07:00:54,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:00:54,800 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 534 flow [2025-03-04 07:00:54,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2025-03-04 07:00:54,807 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2025-03-04 07:00:54,808 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 534 flow [2025-03-04 07:00:54,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-04 07:00:54,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:54,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:00:54,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:00:54,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:54,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 238324913, now seen corresponding path program 1 times [2025-03-04 07:00:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:54,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176138025] [2025-03-04 07:00:54,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:54,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:54,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 07:00:54,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 07:00:54,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:54,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:54,954 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-04 07:00:54,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:54,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176138025] [2025-03-04 07:00:54,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176138025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:54,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:54,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:54,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367556323] [2025-03-04 07:00:54,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:54,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:54,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:54,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:54,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:54,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-03-04 07:00:54,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-04 07:00:54,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:54,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-03-04 07:00:54,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:55,127 INFO L124 PetriNetUnfolderBase]: 134/959 cut-off events. [2025-03-04 07:00:55,127 INFO L125 PetriNetUnfolderBase]: For 166/171 co-relation queries the response was YES. [2025-03-04 07:00:55,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 959 events. 134/959 cut-off events. For 166/171 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5589 event pairs, 84 based on Foata normal form. 4/886 useless extension candidates. Maximal degree in co-relation 1226. Up to 266 conditions per place. [2025-03-04 07:00:55,131 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 29 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2025-03-04 07:00:55,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 634 flow [2025-03-04 07:00:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2025-03-04 07:00:55,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413447782546495 [2025-03-04 07:00:55,133 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 534 flow. Second operand 3 states and 658 transitions. [2025-03-04 07:00:55,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 634 flow [2025-03-04 07:00:55,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:55,138 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 574 flow [2025-03-04 07:00:55,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2025-03-04 07:00:55,140 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2025-03-04 07:00:55,140 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 574 flow [2025-03-04 07:00:55,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-04 07:00:55,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:55,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:00:55,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:00:55,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:55,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:55,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1950905861, now seen corresponding path program 1 times [2025-03-04 07:00:55,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:55,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565612118] [2025-03-04 07:00:55,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:55,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:55,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 07:00:55,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 07:00:55,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:55,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:55,232 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-04 07:00:55,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:55,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565612118] [2025-03-04 07:00:55,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565612118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:55,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:55,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309063872] [2025-03-04 07:00:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:55,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:55,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:55,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:55,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:55,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 233 [2025-03-04 07:00:55,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-04 07:00:55,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:55,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 233 [2025-03-04 07:00:55,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:55,369 INFO L124 PetriNetUnfolderBase]: 93/896 cut-off events. [2025-03-04 07:00:55,369 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-04 07:00:55,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 896 events. 93/896 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5181 event pairs, 51 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1035. Up to 147 conditions per place. [2025-03-04 07:00:55,373 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 17 selfloop transitions, 3 changer transitions 1/249 dead transitions. [2025-03-04 07:00:55,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 249 transitions, 628 flow [2025-03-04 07:00:55,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2025-03-04 07:00:55,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585121602288984 [2025-03-04 07:00:55,375 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 574 flow. Second operand 3 states and 670 transitions. [2025-03-04 07:00:55,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 249 transitions, 628 flow [2025-03-04 07:00:55,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 249 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:55,379 INFO L231 Difference]: Finished difference. Result has 240 places, 245 transitions, 582 flow [2025-03-04 07:00:55,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=240, PETRI_TRANSITIONS=245} [2025-03-04 07:00:55,380 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 7 predicate places. [2025-03-04 07:00:55,380 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 245 transitions, 582 flow [2025-03-04 07:00:55,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-04 07:00:55,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:55,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:00:55,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:00:55,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:55,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1957215895, now seen corresponding path program 1 times [2025-03-04 07:00:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:55,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697481845] [2025-03-04 07:00:55,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:55,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:55,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 07:00:55,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 07:00:55,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:55,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:55,475 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-04 07:00:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:55,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697481845] [2025-03-04 07:00:55,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697481845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:55,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:55,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:55,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811451767] [2025-03-04 07:00:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:55,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:55,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:55,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:55,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:55,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-03-04 07:00:55,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 245 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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-04 07:00:55,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:55,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-03-04 07:00:55,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:55,651 INFO L124 PetriNetUnfolderBase]: 175/1102 cut-off events. [2025-03-04 07:00:55,651 INFO L125 PetriNetUnfolderBase]: For 174/181 co-relation queries the response was YES. [2025-03-04 07:00:55,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 1102 events. 175/1102 cut-off events. For 174/181 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6767 event pairs, 79 based on Foata normal form. 3/1032 useless extension candidates. Maximal degree in co-relation 1622. Up to 303 conditions per place. [2025-03-04 07:00:55,658 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 30 selfloop transitions, 11 changer transitions 0/258 dead transitions. [2025-03-04 07:00:55,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 258 transitions, 704 flow [2025-03-04 07:00:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-03-04 07:00:55,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513590844062947 [2025-03-04 07:00:55,662 INFO L175 Difference]: Start difference. First operand has 240 places, 245 transitions, 582 flow. Second operand 3 states and 665 transitions. [2025-03-04 07:00:55,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 258 transitions, 704 flow [2025-03-04 07:00:55,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 258 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:55,669 INFO L231 Difference]: Finished difference. Result has 242 places, 252 transitions, 664 flow [2025-03-04 07:00:55,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=242, PETRI_TRANSITIONS=252} [2025-03-04 07:00:55,670 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 9 predicate places. [2025-03-04 07:00:55,671 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 252 transitions, 664 flow [2025-03-04 07:00:55,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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-04 07:00:55,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:55,672 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:00:55,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:00:55,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:55,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash -914810848, now seen corresponding path program 1 times [2025-03-04 07:00:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682392650] [2025-03-04 07:00:55,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:55,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 07:00:55,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 07:00:55,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:55,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:55,873 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-04 07:00:55,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:55,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682392650] [2025-03-04 07:00:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682392650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:55,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:00:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675564678] [2025-03-04 07:00:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:55,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:55,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:55,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:55,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 233 [2025-03-04 07:00:55,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 252 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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-04 07:00:55,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:55,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 233 [2025-03-04 07:00:55,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:55,964 INFO L124 PetriNetUnfolderBase]: 23/510 cut-off events. [2025-03-04 07:00:55,965 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-04 07:00:55,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 510 events. 23/510 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1830 event pairs, 7 based on Foata normal form. 6/497 useless extension candidates. Maximal degree in co-relation 496. Up to 44 conditions per place. [2025-03-04 07:00:55,967 INFO L140 encePairwiseOnDemand]: 224/233 looper letters, 6 selfloop transitions, 9 changer transitions 2/234 dead transitions. [2025-03-04 07:00:55,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 234 transitions, 566 flow [2025-03-04 07:00:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 678 transitions. [2025-03-04 07:00:55,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9699570815450643 [2025-03-04 07:00:55,969 INFO L175 Difference]: Start difference. First operand has 242 places, 252 transitions, 664 flow. Second operand 3 states and 678 transitions. [2025-03-04 07:00:55,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 234 transitions, 566 flow [2025-03-04 07:00:55,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 234 transitions, 532 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-03-04 07:00:55,975 INFO L231 Difference]: Finished difference. Result has 234 places, 231 transitions, 523 flow [2025-03-04 07:00:55,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=234, PETRI_TRANSITIONS=231} [2025-03-04 07:00:55,977 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 1 predicate places. [2025-03-04 07:00:55,977 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 231 transitions, 523 flow [2025-03-04 07:00:55,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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-04 07:00:55,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:55,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:00:55,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:00:55,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:55,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash -710249123, now seen corresponding path program 1 times [2025-03-04 07:00:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995072548] [2025-03-04 07:00:55,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:56,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 07:00:56,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 07:00:56,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:56,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:00:56,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:56,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995072548] [2025-03-04 07:00:56,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995072548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:56,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:56,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:56,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022695439] [2025-03-04 07:00:56,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:56,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:56,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:56,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:56,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:56,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 233 [2025-03-04 07:00:56,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 231 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-04 07:00:56,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:56,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 233 [2025-03-04 07:00:56,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:56,159 INFO L124 PetriNetUnfolderBase]: 65/676 cut-off events. [2025-03-04 07:00:56,160 INFO L125 PetriNetUnfolderBase]: For 139/148 co-relation queries the response was YES. [2025-03-04 07:00:56,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 676 events. 65/676 cut-off events. For 139/148 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3242 event pairs, 31 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 866. Up to 137 conditions per place. [2025-03-04 07:00:56,162 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 23 selfloop transitions, 4 changer transitions 3/240 dead transitions. [2025-03-04 07:00:56,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 240 transitions, 619 flow [2025-03-04 07:00:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-03-04 07:00:56,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570815450643777 [2025-03-04 07:00:56,164 INFO L175 Difference]: Start difference. First operand has 234 places, 231 transitions, 523 flow. Second operand 3 states and 669 transitions. [2025-03-04 07:00:56,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 240 transitions, 619 flow [2025-03-04 07:00:56,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 240 transitions, 604 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 07:00:56,168 INFO L231 Difference]: Finished difference. Result has 237 places, 231 transitions, 536 flow [2025-03-04 07:00:56,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=237, PETRI_TRANSITIONS=231} [2025-03-04 07:00:56,170 INFO L279 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2025-03-04 07:00:56,170 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 231 transitions, 536 flow [2025-03-04 07:00:56,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-04 07:00:56,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:56,171 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:00:56,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:00:56,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:56,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1016175522, now seen corresponding path program 1 times [2025-03-04 07:00:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929342264] [2025-03-04 07:00:56,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:56,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:56,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 07:00:56,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 07:00:56,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:56,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:00:56,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:00:56,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 07:00:56,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 07:00:56,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:56,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:00:56,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:00:56,298 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:00:56,299 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-04 07:00:56,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-04 07:00:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-04 07:00:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-04 07:00:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-04 07:00:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-04 07:00:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-04 07:00:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-04 07:00:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-04 07:00:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-04 07:00:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-04 07:00:56,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:00:56,302 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:00:56,304 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 07:00:56,304 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 07:00:56,322 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 07:00:56,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 265 transitions, 540 flow [2025-03-04 07:00:56,354 INFO L124 PetriNetUnfolderBase]: 7/355 cut-off events. [2025-03-04 07:00:56,355 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 07:00:56,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 355 events. 7/355 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 418 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2025-03-04 07:00:56,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 265 transitions, 540 flow [2025-03-04 07:00:56,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 265 transitions, 540 flow [2025-03-04 07:00:56,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:00:56,360 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;@830faf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:00:56,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 07:00:56,372 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 07:00:56,372 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-04 07:00:56,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:00:56,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:56,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:00:56,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:00:56,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash -963022743, now seen corresponding path program 1 times [2025-03-04 07:00:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:56,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768260347] [2025-03-04 07:00:56,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:56,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 07:00:56,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 07:00:56,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:56,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:00:56,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768260347] [2025-03-04 07:00:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768260347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:56,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738781696] [2025-03-04 07:00:56,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:56,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:56,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:56,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:56,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 265 [2025-03-04 07:00:56,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 265 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-04 07:00:56,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:56,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 265 [2025-03-04 07:00:56,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:57,483 INFO L124 PetriNetUnfolderBase]: 2700/8735 cut-off events. [2025-03-04 07:00:57,484 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 07:00:57,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13188 conditions, 8735 events. 2700/8735 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 88848 event pairs, 968 based on Foata normal form. 1/7747 useless extension candidates. Maximal degree in co-relation 5927. Up to 2282 conditions per place. [2025-03-04 07:00:57,542 INFO L140 encePairwiseOnDemand]: 248/265 looper letters, 46 selfloop transitions, 11 changer transitions 1/289 dead transitions. [2025-03-04 07:00:57,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 289 transitions, 707 flow [2025-03-04 07:00:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-03-04 07:00:57,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2025-03-04 07:00:57,545 INFO L175 Difference]: Start difference. First operand has 267 places, 265 transitions, 540 flow. Second operand 3 states and 760 transitions. [2025-03-04 07:00:57,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 289 transitions, 707 flow [2025-03-04 07:00:57,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 289 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:00:57,550 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 630 flow [2025-03-04 07:00:57,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2025-03-04 07:00:57,551 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 4 predicate places. [2025-03-04 07:00:57,551 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 630 flow [2025-03-04 07:00:57,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-04 07:00:57,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:57,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:00:57,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:00:57,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:00:57,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1777629402, now seen corresponding path program 1 times [2025-03-04 07:00:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:57,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223741447] [2025-03-04 07:00:57,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:57,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:57,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 07:00:57,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 07:00:57,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:57,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:57,665 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-04 07:00:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:57,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223741447] [2025-03-04 07:00:57,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223741447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:57,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:57,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19522661] [2025-03-04 07:00:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:57,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:57,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:57,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:57,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 265 [2025-03-04 07:00:57,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-04 07:00:57,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:57,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 265 [2025-03-04 07:00:57,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:58,887 INFO L124 PetriNetUnfolderBase]: 2944/10783 cut-off events. [2025-03-04 07:00:58,887 INFO L125 PetriNetUnfolderBase]: For 3011/3115 co-relation queries the response was YES. [2025-03-04 07:00:58,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18652 conditions, 10783 events. 2944/10783 cut-off events. For 3011/3115 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 119413 event pairs, 1867 based on Foata normal form. 56/9768 useless extension candidates. Maximal degree in co-relation 16666. Up to 4168 conditions per place. [2025-03-04 07:00:58,953 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 42 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2025-03-04 07:00:58,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 291 transitions, 798 flow [2025-03-04 07:00:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2025-03-04 07:00:58,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9383647798742139 [2025-03-04 07:00:58,957 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 630 flow. Second operand 3 states and 746 transitions. [2025-03-04 07:00:58,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 291 transitions, 798 flow [2025-03-04 07:00:58,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 291 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:58,968 INFO L231 Difference]: Finished difference. Result has 272 places, 283 transitions, 714 flow [2025-03-04 07:00:58,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=272, PETRI_TRANSITIONS=283} [2025-03-04 07:00:58,970 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2025-03-04 07:00:58,970 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 283 transitions, 714 flow [2025-03-04 07:00:58,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-04 07:00:58,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:58,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:00:58,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:00:58,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:00:58,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1477106693, now seen corresponding path program 1 times [2025-03-04 07:00:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:58,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510835333] [2025-03-04 07:00:58,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:58,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 07:00:58,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 07:00:58,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:58,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:59,036 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-04 07:00:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510835333] [2025-03-04 07:00:59,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510835333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:59,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:59,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689231822] [2025-03-04 07:00:59,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:59,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:59,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:59,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:59,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 265 [2025-03-04 07:00:59,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 283 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-04 07:00:59,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:59,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 265 [2025-03-04 07:00:59,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:00,112 INFO L124 PetriNetUnfolderBase]: 2291/10347 cut-off events. [2025-03-04 07:01:00,112 INFO L125 PetriNetUnfolderBase]: For 1030/1094 co-relation queries the response was YES. [2025-03-04 07:01:00,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16095 conditions, 10347 events. 2291/10347 cut-off events. For 1030/1094 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 119392 event pairs, 1380 based on Foata normal form. 4/9331 useless extension candidates. Maximal degree in co-relation 14478. Up to 2487 conditions per place. [2025-03-04 07:01:00,155 INFO L140 encePairwiseOnDemand]: 260/265 looper letters, 28 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2025-03-04 07:01:00,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 294 transitions, 800 flow [2025-03-04 07:01:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-03-04 07:01:00,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2025-03-04 07:01:00,158 INFO L175 Difference]: Start difference. First operand has 272 places, 283 transitions, 714 flow. Second operand 3 states and 759 transitions. [2025-03-04 07:01:00,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 294 transitions, 800 flow [2025-03-04 07:01:00,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 294 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:00,168 INFO L231 Difference]: Finished difference. Result has 274 places, 286 transitions, 720 flow [2025-03-04 07:01:00,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=274, PETRI_TRANSITIONS=286} [2025-03-04 07:01:00,169 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 7 predicate places. [2025-03-04 07:01:00,170 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 286 transitions, 720 flow [2025-03-04 07:01:00,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-04 07:01:00,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:00,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:00,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:01:00,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:00,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash 629573654, now seen corresponding path program 1 times [2025-03-04 07:01:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110806761] [2025-03-04 07:01:00,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:00,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 07:01:00,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 07:01:00,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:00,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:00,238 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-04 07:01:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110806761] [2025-03-04 07:01:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110806761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141449590] [2025-03-04 07:01:00,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:00,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:00,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:00,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:00,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 265 [2025-03-04 07:01:00,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 286 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-04 07:01:00,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:00,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 265 [2025-03-04 07:01:00,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:00,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][251], [40#L692-2true, Black: 270#true, 227#L692-7true, 268#true, 61#L712-2true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 280#true, Black: 282#(= |#race~data~0| 0), 266#true, 285#true]) [2025-03-04 07:01:00,725 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2025-03-04 07:01:00,725 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2025-03-04 07:01:00,725 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-04 07:01:00,725 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2025-03-04 07:01:00,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [Black: 270#true, 114#L694-3true, 227#L692-7true, 268#true, 61#L712-2true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 280#true, Black: 282#(= |#race~data~0| 0), 266#true, 285#true]) [2025-03-04 07:01:00,825 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-03-04 07:01:00,826 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-04 07:01:00,826 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-04 07:01:00,826 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-04 07:01:00,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [Black: 270#true, 227#L692-7true, 268#true, 61#L712-2true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 210#L694true, 280#true, Black: 282#(= |#race~data~0| 0), 266#true, 285#true]) [2025-03-04 07:01:00,939 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-04 07:01:00,939 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-03-04 07:01:00,939 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-03-04 07:01:00,939 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-04 07:01:01,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [Black: 270#true, 227#L692-7true, 268#true, 61#L712-2true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 221#L695true, 280#true, Black: 282#(= |#race~data~0| 0), 266#true, 285#true]) [2025-03-04 07:01:01,057 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-04 07:01:01,057 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-04 07:01:01,057 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-04 07:01:01,057 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-04 07:01:01,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [Black: 270#true, 227#L692-7true, 268#true, 61#L712-2true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 41#L697true, Black: 282#(= |#race~data~0| 0), 280#true, 266#true, 285#true]) [2025-03-04 07:01:01,502 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-04 07:01:01,502 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-04 07:01:01,502 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-04 07:01:01,502 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-04 07:01:01,771 INFO L124 PetriNetUnfolderBase]: 4357/14868 cut-off events. [2025-03-04 07:01:01,771 INFO L125 PetriNetUnfolderBase]: For 5122/5554 co-relation queries the response was YES. [2025-03-04 07:01:01,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27211 conditions, 14868 events. 4357/14868 cut-off events. For 5122/5554 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 169447 event pairs, 2217 based on Foata normal form. 111/13359 useless extension candidates. Maximal degree in co-relation 25085. Up to 5572 conditions per place. [2025-03-04 07:01:01,858 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 49 selfloop transitions, 19 changer transitions 0/312 dead transitions. [2025-03-04 07:01:01,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 312 transitions, 957 flow [2025-03-04 07:01:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2025-03-04 07:01:01,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9484276729559749 [2025-03-04 07:01:01,861 INFO L175 Difference]: Start difference. First operand has 274 places, 286 transitions, 720 flow. Second operand 3 states and 754 transitions. [2025-03-04 07:01:01,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 312 transitions, 957 flow [2025-03-04 07:01:01,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 312 transitions, 949 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:01,872 INFO L231 Difference]: Finished difference. Result has 276 places, 301 transitions, 894 flow [2025-03-04 07:01:01,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=276, PETRI_TRANSITIONS=301} [2025-03-04 07:01:01,873 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 9 predicate places. [2025-03-04 07:01:01,873 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 301 transitions, 894 flow [2025-03-04 07:01:01,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-04 07:01:01,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:01,874 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:01:01,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:01:01,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:01,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash -635328033, now seen corresponding path program 1 times [2025-03-04 07:01:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:01,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596314393] [2025-03-04 07:01:01,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:01,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:01,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 07:01:01,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 07:01:01,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:01,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:01,997 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-04 07:01:01,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:01,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596314393] [2025-03-04 07:01:01,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596314393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:01,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:01,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:01:01,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543885516] [2025-03-04 07:01:01,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:01,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:01,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:02,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:02,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:02,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 265 [2025-03-04 07:01:02,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 301 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-04 07:01:02,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:02,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 265 [2025-03-04 07:01:02,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:02,390 INFO L124 PetriNetUnfolderBase]: 455/3435 cut-off events. [2025-03-04 07:01:02,390 INFO L125 PetriNetUnfolderBase]: For 773/816 co-relation queries the response was YES. [2025-03-04 07:01:02,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5476 conditions, 3435 events. 455/3435 cut-off events. For 773/816 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 32184 event pairs, 150 based on Foata normal form. 71/3267 useless extension candidates. Maximal degree in co-relation 2748. Up to 485 conditions per place. [2025-03-04 07:01:02,402 INFO L140 encePairwiseOnDemand]: 253/265 looper letters, 15 selfloop transitions, 12 changer transitions 0/301 dead transitions. [2025-03-04 07:01:02,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 301 transitions, 883 flow [2025-03-04 07:01:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2025-03-04 07:01:02,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685534591194969 [2025-03-04 07:01:02,404 INFO L175 Difference]: Start difference. First operand has 276 places, 301 transitions, 894 flow. Second operand 3 states and 770 transitions. [2025-03-04 07:01:02,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 301 transitions, 883 flow [2025-03-04 07:01:02,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 301 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:02,410 INFO L231 Difference]: Finished difference. Result has 277 places, 298 transitions, 846 flow [2025-03-04 07:01:02,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=277, PETRI_TRANSITIONS=298} [2025-03-04 07:01:02,411 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 10 predicate places. [2025-03-04 07:01:02,411 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 298 transitions, 846 flow [2025-03-04 07:01:02,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-04 07:01:02,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:02,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:02,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:01:02,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:02,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash -430766308, now seen corresponding path program 1 times [2025-03-04 07:01:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:02,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665104276] [2025-03-04 07:01:02,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:02,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:02,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 07:01:02,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 07:01:02,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:02,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:02,464 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-04 07:01:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665104276] [2025-03-04 07:01:02,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665104276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:02,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:02,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317863376] [2025-03-04 07:01:02,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:02,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:02,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:02,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:02,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 265 [2025-03-04 07:01:02,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 298 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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-04 07:01:02,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:02,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 265 [2025-03-04 07:01:02,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:03,062 INFO L124 PetriNetUnfolderBase]: 1326/5995 cut-off events. [2025-03-04 07:01:03,062 INFO L125 PetriNetUnfolderBase]: For 2522/2706 co-relation queries the response was YES. [2025-03-04 07:01:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 5995 events. 1326/5995 cut-off events. For 2522/2706 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 61023 event pairs, 633 based on Foata normal form. 8/5612 useless extension candidates. Maximal degree in co-relation 10722. Up to 1800 conditions per place. [2025-03-04 07:01:03,082 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 45 selfloop transitions, 7 changer transitions 0/318 dead transitions. [2025-03-04 07:01:03,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 318 transitions, 1036 flow [2025-03-04 07:01:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2025-03-04 07:01:03,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547169811320755 [2025-03-04 07:01:03,084 INFO L175 Difference]: Start difference. First operand has 277 places, 298 transitions, 846 flow. Second operand 3 states and 759 transitions. [2025-03-04 07:01:03,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 318 transitions, 1036 flow [2025-03-04 07:01:03,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 318 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 07:01:03,091 INFO L231 Difference]: Finished difference. Result has 280 places, 303 transitions, 890 flow [2025-03-04 07:01:03,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=280, PETRI_TRANSITIONS=303} [2025-03-04 07:01:03,091 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 13 predicate places. [2025-03-04 07:01:03,091 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 303 transitions, 890 flow [2025-03-04 07:01:03,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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-04 07:01:03,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:03,092 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 07:01:03,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:01:03,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:03,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1473450480, now seen corresponding path program 1 times [2025-03-04 07:01:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061418430] [2025-03-04 07:01:03,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:03,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-04 07:01:03,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-04 07:01:03,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:03,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:03,156 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-04 07:01:03,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:03,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061418430] [2025-03-04 07:01:03,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061418430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:03,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:03,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:03,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692676279] [2025-03-04 07:01:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:03,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:03,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:03,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:03,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 265 [2025-03-04 07:01:03,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 303 transitions, 890 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-04 07:01:03,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:03,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 265 [2025-03-04 07:01:03,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:03,615 INFO L124 PetriNetUnfolderBase]: 820/4565 cut-off events. [2025-03-04 07:01:03,615 INFO L125 PetriNetUnfolderBase]: For 2624/2981 co-relation queries the response was YES. [2025-03-04 07:01:03,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9256 conditions, 4565 events. 820/4565 cut-off events. For 2624/2981 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 45913 event pairs, 395 based on Foata normal form. 8/4297 useless extension candidates. Maximal degree in co-relation 8261. Up to 1381 conditions per place. [2025-03-04 07:01:03,712 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 56 selfloop transitions, 11 changer transitions 0/318 dead transitions. [2025-03-04 07:01:03,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 318 transitions, 1092 flow [2025-03-04 07:01:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2025-03-04 07:01:03,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9421383647798742 [2025-03-04 07:01:03,717 INFO L175 Difference]: Start difference. First operand has 280 places, 303 transitions, 890 flow. Second operand 3 states and 749 transitions. [2025-03-04 07:01:03,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 318 transitions, 1092 flow [2025-03-04 07:01:03,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 318 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:03,726 INFO L231 Difference]: Finished difference. Result has 282 places, 310 transitions, 974 flow [2025-03-04 07:01:03,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=974, PETRI_PLACES=282, PETRI_TRANSITIONS=310} [2025-03-04 07:01:03,728 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 15 predicate places. [2025-03-04 07:01:03,728 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 310 transitions, 974 flow [2025-03-04 07:01:03,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-04 07:01:03,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:03,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:03,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:01:03,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:03,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:03,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1231275817, now seen corresponding path program 1 times [2025-03-04 07:01:03,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:03,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712717937] [2025-03-04 07:01:03,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:03,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:03,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-04 07:01:03,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-04 07:01:03,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:03,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:01:03,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:01:03,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-04 07:01:03,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-04 07:01:03,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:03,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:01:03,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:01:03,822 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:01:03,822 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-03-04 07:01:03,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-04 07:01:03,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-04 07:01:03,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-04 07:01:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-04 07:01:03,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:01:03,823 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:03,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-03-04 07:01:03,931 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-03-04 07:01:03,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-03-04 07:01:03,936 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-03-04 07:01:03,936 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:01:03,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:01:03 BasicIcfg [2025-03-04 07:01:03,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:01:03,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:01:03,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:01:03,941 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:01:03,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:00:53" (3/4) ... [2025-03-04 07:01:03,942 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 07:01:03,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-03-04 07:01:03,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2025-03-04 07:01:03,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2025-03-04 07:01:04,021 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-03-04 07:01:04,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:01:04,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:01:04,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:01:04,059 INFO L158 Benchmark]: Toolchain (without parser) took 11000.79ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 110.9MB in the beginning and 437.1MB in the end (delta: -326.2MB). Peak memory consumption was 592.6MB. Max. memory is 16.1GB. [2025-03-04 07:01:04,059 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 125.4MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:01:04,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.08ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 90.4MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:01:04,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.53ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:01:04,059 INFO L158 Benchmark]: Boogie Preprocessor took 22.39ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:01:04,059 INFO L158 Benchmark]: IcfgBuilder took 436.29ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 64.1MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 07:01:04,059 INFO L158 Benchmark]: TraceAbstraction took 10066.79ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 63.6MB in the beginning and 508.4MB in the end (delta: -444.8MB). Peak memory consumption was 475.2MB. Max. memory is 16.1GB. [2025-03-04 07:01:04,061 INFO L158 Benchmark]: Witness Printer took 117.54ms. Allocated memory is still 1.1GB. Free memory was 508.4MB in the beginning and 437.1MB in the end (delta: 71.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 07:01:04,062 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.23ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 125.4MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.08ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 90.4MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.53ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.39ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 436.29ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 64.1MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10066.79ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 63.6MB in the beginning and 508.4MB in the end (delta: -444.8MB). Peak memory consumption was 475.2MB. Max. memory is 16.1GB. * Witness Printer took 117.54ms. Allocated memory is still 1.1GB. Free memory was 508.4MB in the beginning and 437.1MB in the end (delta: 71.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 715]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [threads_alive=0, threads_alive_mutex={1:0}] [L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [threads_alive=0, threads_alive_mutex={1:0}] [L688] 0 int data = 0; VAL [data=0, threads_alive=0, threads_alive_mutex={1:0}] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L701] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L702] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L702] RET 0 assume_abort_if_not(threads_total >= 0) [L703] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L705] 0 threads_alive++ VAL [data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1] [L707] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1] [L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1, tid=-1] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L703] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L712] COND TRUE 0 \read(threads_alive) [L712] COND FALSE 0 !(\read(threads_alive)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L696] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] Now there is a data race on ~data~0 between C: data = __VERIFIER_nondet_int() [696] and C: return data; [715] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 263 locations, 11 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: 2.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 17 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=4, InterpolantAutomatonStates: 18, 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.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1226 NumberOfCodeBlocks, 1226 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 295 locations, 14 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: 7.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 464 IncrementalHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 36 mSDtfsCounter, 464 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=7, InterpolantAutomatonStates: 21, 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, 1444 NumberOfCodeBlocks, 1444 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-04 07:01:04,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)