./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.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 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:36:15,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:36:16,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:36:16,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:36:16,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:36:16,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:36:16,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:36:16,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:36:16,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:36:16,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:36:16,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:36:16,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:36:16,079 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:36:16,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:36:16,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:36:16,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:36:16,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:36:16,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:36:16,081 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:36:16,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:36:16,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:36:16,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:36:16,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:36:16,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:36:16,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:36:16,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:36:16,081 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 -> 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb [2025-03-08 21:36:16,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:36:16,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:36:16,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:36:16,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:36:16,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:36:16,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2025-03-08 21:36:17,479 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b77682d/01d9709201e545aa8cedd4d943d31942/FLAG10c97c549 [2025-03-08 21:36:17,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:36:17,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2025-03-08 21:36:17,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b77682d/01d9709201e545aa8cedd4d943d31942/FLAG10c97c549 [2025-03-08 21:36:18,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b77682d/01d9709201e545aa8cedd4d943d31942 [2025-03-08 21:36:18,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:36:18,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:36:18,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:36:18,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:36:18,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:36:18,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a59940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18, skipping insertion in model container [2025-03-08 21:36:18,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:36:18,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:36:18,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:36:18,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:36:18,393 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:36:18,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18 WrapperNode [2025-03-08 21:36:18,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:36:18,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:36:18,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:36:18,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:36:18,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,431 INFO L138 Inliner]: procedures = 169, calls = 15, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 123 [2025-03-08 21:36:18,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:36:18,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:36:18,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:36:18,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:36:18,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:36:18,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:36:18,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:36:18,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:36:18,447 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (1/1) ... [2025-03-08 21:36:18,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:36:18,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:36:18,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:36:18,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:36:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:36:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-03-08 21:36:18,501 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-03-08 21:36:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:36:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:36:18,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:36:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-08 21:36:18,501 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-08 21:36:18,502 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:36:18,597 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:36:18,598 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:36:18,773 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:36:18,773 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:36:18,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:36:18,865 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:36:18,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:18 BoogieIcfgContainer [2025-03-08 21:36:18,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:36:18,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:36:18,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:36:18,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:36:18,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:36:18" (1/3) ... [2025-03-08 21:36:18,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e07ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:36:18, skipping insertion in model container [2025-03-08 21:36:18,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:18" (2/3) ... [2025-03-08 21:36:18,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e07ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:36:18, skipping insertion in model container [2025-03-08 21:36:18,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:18" (3/3) ... [2025-03-08 21:36:18,874 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2b.i [2025-03-08 21:36:18,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:36:18,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-2b.i that has 3 procedures, 110 locations, 1 initial locations, 0 loop locations, and 14 error locations. [2025-03-08 21:36:18,887 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:36:18,953 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 21:36:18,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 174 transitions, 376 flow [2025-03-08 21:36:19,044 INFO L124 PetriNetUnfolderBase]: 4/170 cut-off events. [2025-03-08 21:36:19,048 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:36:19,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 170 events. 4/170 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 433 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 148. Up to 2 conditions per place. [2025-03-08 21:36:19,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 174 transitions, 376 flow [2025-03-08 21:36:19,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 165 transitions, 351 flow [2025-03-08 21:36:19,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:36:19,076 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;@6e96a006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:36:19,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-08 21:36:19,087 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:36:19,087 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-08 21:36:19,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:36:19,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:19,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:19,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:19,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash 531145072, now seen corresponding path program 1 times [2025-03-08 21:36:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:19,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742881890] [2025-03-08 21:36:19,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:19,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 21:36:19,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 21:36:19,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:19,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:19,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:19,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742881890] [2025-03-08 21:36:19,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742881890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:19,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:19,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:36:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349375723] [2025-03-08 21:36:19,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:19,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:36:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:19,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:36:19,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:36:19,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 174 [2025-03-08 21:36:19,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 165 transitions, 351 flow. Second operand has 2 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:19,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:19,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 174 [2025-03-08 21:36:19,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:19,450 INFO L124 PetriNetUnfolderBase]: 51/829 cut-off events. [2025-03-08 21:36:19,450 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-08 21:36:19,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 829 events. 51/829 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5464 event pairs, 51 based on Foata normal form. 38/718 useless extension candidates. Maximal degree in co-relation 860. Up to 96 conditions per place. [2025-03-08 21:36:19,457 INFO L140 encePairwiseOnDemand]: 158/174 looper letters, 11 selfloop transitions, 0 changer transitions 0/145 dead transitions. [2025-03-08 21:36:19,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 145 transitions, 333 flow [2025-03-08 21:36:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:36:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:36:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 315 transitions. [2025-03-08 21:36:19,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9051724137931034 [2025-03-08 21:36:19,471 INFO L175 Difference]: Start difference. First operand has 174 places, 165 transitions, 351 flow. Second operand 2 states and 315 transitions. [2025-03-08 21:36:19,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 145 transitions, 333 flow [2025-03-08 21:36:19,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 145 transitions, 320 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 21:36:19,478 INFO L231 Difference]: Finished difference. Result has 152 places, 145 transitions, 298 flow [2025-03-08 21:36:19,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=298, PETRI_PLACES=152, PETRI_TRANSITIONS=145} [2025-03-08 21:36:19,483 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -22 predicate places. [2025-03-08 21:36:19,484 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 145 transitions, 298 flow [2025-03-08 21:36:19,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:19,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:19,485 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] [2025-03-08 21:36:19,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:36:19,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting writerErr1ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:19,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash -276077130, now seen corresponding path program 1 times [2025-03-08 21:36:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:19,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822890603] [2025-03-08 21:36:19,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:19,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:19,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 21:36:19,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 21:36:19,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:19,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:19,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822890603] [2025-03-08 21:36:19,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822890603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:19,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:19,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436464602] [2025-03-08 21:36:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:19,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:19,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:19,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:19,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 174 [2025-03-08 21:36:19,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 145 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:19,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:19,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 174 [2025-03-08 21:36:19,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:20,188 INFO L124 PetriNetUnfolderBase]: 1206/5690 cut-off events. [2025-03-08 21:36:20,188 INFO L125 PetriNetUnfolderBase]: For 55/82 co-relation queries the response was YES. [2025-03-08 21:36:20,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7732 conditions, 5690 events. 1206/5690 cut-off events. For 55/82 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 62091 event pairs, 746 based on Foata normal form. 0/4662 useless extension candidates. Maximal degree in co-relation 7729. Up to 1501 conditions per place. [2025-03-08 21:36:20,229 INFO L140 encePairwiseOnDemand]: 165/174 looper letters, 26 selfloop transitions, 8 changer transitions 0/158 dead transitions. [2025-03-08 21:36:20,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 158 transitions, 396 flow [2025-03-08 21:36:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2025-03-08 21:36:20,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8371647509578544 [2025-03-08 21:36:20,232 INFO L175 Difference]: Start difference. First operand has 152 places, 145 transitions, 298 flow. Second operand 3 states and 437 transitions. [2025-03-08 21:36:20,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 158 transitions, 396 flow [2025-03-08 21:36:20,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 158 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:36:20,238 INFO L231 Difference]: Finished difference. Result has 156 places, 152 transitions, 360 flow [2025-03-08 21:36:20,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=156, PETRI_TRANSITIONS=152} [2025-03-08 21:36:20,239 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -18 predicate places. [2025-03-08 21:36:20,239 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 152 transitions, 360 flow [2025-03-08 21:36:20,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:20,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:20,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:20,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:36:20,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:20,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1443102243, now seen corresponding path program 1 times [2025-03-08 21:36:20,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:20,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587975068] [2025-03-08 21:36:20,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:20,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:36:20,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:36:20,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:20,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:20,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:20,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587975068] [2025-03-08 21:36:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587975068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:20,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:20,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:20,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83799312] [2025-03-08 21:36:20,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:20,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:20,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:20,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:20,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:20,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 174 [2025-03-08 21:36:20,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 152 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:20,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:20,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 174 [2025-03-08 21:36:20,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:21,713 INFO L124 PetriNetUnfolderBase]: 3944/17282 cut-off events. [2025-03-08 21:36:21,714 INFO L125 PetriNetUnfolderBase]: For 3687/4562 co-relation queries the response was YES. [2025-03-08 21:36:21,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27404 conditions, 17282 events. 3944/17282 cut-off events. For 3687/4562 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 227027 event pairs, 1120 based on Foata normal form. 27/14139 useless extension candidates. Maximal degree in co-relation 27399. Up to 3401 conditions per place. [2025-03-08 21:36:21,880 INFO L140 encePairwiseOnDemand]: 160/174 looper letters, 39 selfloop transitions, 15 changer transitions 0/176 dead transitions. [2025-03-08 21:36:21,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 176 transitions, 556 flow [2025-03-08 21:36:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-03-08 21:36:21,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8390804597701149 [2025-03-08 21:36:21,883 INFO L175 Difference]: Start difference. First operand has 156 places, 152 transitions, 360 flow. Second operand 3 states and 438 transitions. [2025-03-08 21:36:21,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 176 transitions, 556 flow [2025-03-08 21:36:21,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 176 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:21,911 INFO L231 Difference]: Finished difference. Result has 158 places, 167 transitions, 494 flow [2025-03-08 21:36:21,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=158, PETRI_TRANSITIONS=167} [2025-03-08 21:36:21,912 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -16 predicate places. [2025-03-08 21:36:21,912 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 167 transitions, 494 flow [2025-03-08 21:36:21,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:21,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:21,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:21,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:36:21,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1241401766, now seen corresponding path program 1 times [2025-03-08 21:36:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:21,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123506473] [2025-03-08 21:36:21,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:21,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:36:21,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:36:21,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:21,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:21,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123506473] [2025-03-08 21:36:21,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123506473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:21,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:21,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200199585] [2025-03-08 21:36:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:21,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:21,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:21,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:21,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:21,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 174 [2025-03-08 21:36:21,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 167 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:21,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:21,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 174 [2025-03-08 21:36:21,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:23,551 INFO L124 PetriNetUnfolderBase]: 3945/19878 cut-off events. [2025-03-08 21:36:23,552 INFO L125 PetriNetUnfolderBase]: For 5207/7922 co-relation queries the response was YES. [2025-03-08 21:36:23,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32496 conditions, 19878 events. 3945/19878 cut-off events. For 5207/7922 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 277922 event pairs, 1184 based on Foata normal form. 32/16376 useless extension candidates. Maximal degree in co-relation 32490. Up to 3043 conditions per place. [2025-03-08 21:36:23,702 INFO L140 encePairwiseOnDemand]: 166/174 looper letters, 19 selfloop transitions, 7 changer transitions 0/176 dead transitions. [2025-03-08 21:36:23,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 176 transitions, 568 flow [2025-03-08 21:36:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2025-03-08 21:36:23,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8448275862068966 [2025-03-08 21:36:23,704 INFO L175 Difference]: Start difference. First operand has 158 places, 167 transitions, 494 flow. Second operand 3 states and 441 transitions. [2025-03-08 21:36:23,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 176 transitions, 568 flow [2025-03-08 21:36:23,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 176 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:23,719 INFO L231 Difference]: Finished difference. Result has 160 places, 173 transitions, 518 flow [2025-03-08 21:36:23,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=160, PETRI_TRANSITIONS=173} [2025-03-08 21:36:23,720 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -14 predicate places. [2025-03-08 21:36:23,720 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 173 transitions, 518 flow [2025-03-08 21:36:23,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:23,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:23,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:23,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:36:23,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting writerErr1ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:23,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1445611287, now seen corresponding path program 1 times [2025-03-08 21:36:23,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:23,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985189769] [2025-03-08 21:36:23,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:23,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:23,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 21:36:23,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 21:36:23,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:23,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:23,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:23,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985189769] [2025-03-08 21:36:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985189769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:23,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:36:23,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441650721] [2025-03-08 21:36:23,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:23,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:36:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:23,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:36:23,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:36:23,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 174 [2025-03-08 21:36:23,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 173 transitions, 518 flow. Second operand has 5 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:23,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:23,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 174 [2025-03-08 21:36:23,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:26,995 INFO L124 PetriNetUnfolderBase]: 10151/44991 cut-off events. [2025-03-08 21:36:26,995 INFO L125 PetriNetUnfolderBase]: For 7778/13048 co-relation queries the response was YES. [2025-03-08 21:36:27,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73637 conditions, 44991 events. 10151/44991 cut-off events. For 7778/13048 co-relation queries the response was YES. Maximal size of possible extension queue 1820. Compared 691190 event pairs, 2356 based on Foata normal form. 77/36416 useless extension candidates. Maximal degree in co-relation 73630. Up to 6509 conditions per place. [2025-03-08 21:36:27,320 INFO L140 encePairwiseOnDemand]: 164/174 looper letters, 31 selfloop transitions, 17 changer transitions 0/201 dead transitions. [2025-03-08 21:36:27,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 201 transitions, 707 flow [2025-03-08 21:36:27,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:36:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 21:36:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 735 transitions. [2025-03-08 21:36:27,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8448275862068966 [2025-03-08 21:36:27,324 INFO L175 Difference]: Start difference. First operand has 160 places, 173 transitions, 518 flow. Second operand 5 states and 735 transitions. [2025-03-08 21:36:27,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 201 transitions, 707 flow [2025-03-08 21:36:27,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 201 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:27,360 INFO L231 Difference]: Finished difference. Result has 165 places, 187 transitions, 627 flow [2025-03-08 21:36:27,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=627, PETRI_PLACES=165, PETRI_TRANSITIONS=187} [2025-03-08 21:36:27,361 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -9 predicate places. [2025-03-08 21:36:27,361 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 187 transitions, 627 flow [2025-03-08 21:36:27,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:27,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:27,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:27,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:36:27,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting writerErr1ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:27,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:27,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1192774377, now seen corresponding path program 2 times [2025-03-08 21:36:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:27,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427575760] [2025-03-08 21:36:27,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:36:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:27,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-03-08 21:36:27,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 21:36:27,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:36:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:27,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427575760] [2025-03-08 21:36:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427575760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:27,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:27,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:27,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107049551] [2025-03-08 21:36:27,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:27,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:27,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:27,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:27,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:27,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 174 [2025-03-08 21:36:27,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 187 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:27,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:27,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 174 [2025-03-08 21:36:27,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:28,520 INFO L124 PetriNetUnfolderBase]: 2626/18284 cut-off events. [2025-03-08 21:36:28,521 INFO L125 PetriNetUnfolderBase]: For 4127/5017 co-relation queries the response was YES. [2025-03-08 21:36:28,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29075 conditions, 18284 events. 2626/18284 cut-off events. For 4127/5017 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 263267 event pairs, 808 based on Foata normal form. 141/15058 useless extension candidates. Maximal degree in co-relation 29066. Up to 2621 conditions per place. [2025-03-08 21:36:28,643 INFO L140 encePairwiseOnDemand]: 168/174 looper letters, 19 selfloop transitions, 7 changer transitions 0/182 dead transitions. [2025-03-08 21:36:28,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 182 transitions, 637 flow [2025-03-08 21:36:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2025-03-08 21:36:28,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8544061302681992 [2025-03-08 21:36:28,644 INFO L175 Difference]: Start difference. First operand has 165 places, 187 transitions, 627 flow. Second operand 3 states and 446 transitions. [2025-03-08 21:36:28,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 182 transitions, 637 flow [2025-03-08 21:36:28,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 182 transitions, 623 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-08 21:36:28,651 INFO L231 Difference]: Finished difference. Result has 166 places, 177 transitions, 569 flow [2025-03-08 21:36:28,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=569, PETRI_PLACES=166, PETRI_TRANSITIONS=177} [2025-03-08 21:36:28,652 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -8 predicate places. [2025-03-08 21:36:28,652 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 177 transitions, 569 flow [2025-03-08 21:36:28,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:28,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:28,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:28,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:36:28,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:28,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1354894427, now seen corresponding path program 1 times [2025-03-08 21:36:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:28,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818949675] [2025-03-08 21:36:28,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:28,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 21:36:28,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 21:36:28,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:28,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818949675] [2025-03-08 21:36:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818949675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:28,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:28,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:28,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375060223] [2025-03-08 21:36:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:28,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:28,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:28,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:28,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:28,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 174 [2025-03-08 21:36:28,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 177 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:28,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:28,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 174 [2025-03-08 21:36:28,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:31,279 INFO L124 PetriNetUnfolderBase]: 5683/31602 cut-off events. [2025-03-08 21:36:31,280 INFO L125 PetriNetUnfolderBase]: For 12554/13723 co-relation queries the response was YES. [2025-03-08 21:36:31,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53946 conditions, 31602 events. 5683/31602 cut-off events. For 12554/13723 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 483690 event pairs, 2140 based on Foata normal form. 3/25676 useless extension candidates. Maximal degree in co-relation 53937. Up to 3941 conditions per place. [2025-03-08 21:36:31,668 INFO L140 encePairwiseOnDemand]: 168/174 looper letters, 33 selfloop transitions, 5 changer transitions 0/189 dead transitions. [2025-03-08 21:36:31,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 189 transitions, 699 flow [2025-03-08 21:36:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-03-08 21:36:31,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8390804597701149 [2025-03-08 21:36:31,670 INFO L175 Difference]: Start difference. First operand has 166 places, 177 transitions, 569 flow. Second operand 3 states and 438 transitions. [2025-03-08 21:36:31,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 189 transitions, 699 flow [2025-03-08 21:36:31,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 189 transitions, 679 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:31,684 INFO L231 Difference]: Finished difference. Result has 168 places, 181 transitions, 593 flow [2025-03-08 21:36:31,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=168, PETRI_TRANSITIONS=181} [2025-03-08 21:36:31,685 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2025-03-08 21:36:31,685 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 181 transitions, 593 flow [2025-03-08 21:36:31,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:31,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:31,685 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] [2025-03-08 21:36:31,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:36:31,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting writerErr1ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:31,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -239028511, now seen corresponding path program 1 times [2025-03-08 21:36:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:31,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812375345] [2025-03-08 21:36:31,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:31,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 21:36:31,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 21:36:31,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:31,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:31,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812375345] [2025-03-08 21:36:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812375345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:31,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:31,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29451912] [2025-03-08 21:36:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:31,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:31,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:31,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:31,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 174 [2025-03-08 21:36:31,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 181 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:31,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:31,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 174 [2025-03-08 21:36:31,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:34,180 INFO L124 PetriNetUnfolderBase]: 7006/40751 cut-off events. [2025-03-08 21:36:34,180 INFO L125 PetriNetUnfolderBase]: For 17932/22676 co-relation queries the response was YES. [2025-03-08 21:36:34,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71946 conditions, 40751 events. 7006/40751 cut-off events. For 17932/22676 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 655667 event pairs, 2320 based on Foata normal form. 159/33627 useless extension candidates. Maximal degree in co-relation 71936. Up to 7090 conditions per place. [2025-03-08 21:36:34,617 INFO L140 encePairwiseOnDemand]: 166/174 looper letters, 43 selfloop transitions, 12 changer transitions 0/194 dead transitions. [2025-03-08 21:36:34,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 194 transitions, 765 flow [2025-03-08 21:36:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2025-03-08 21:36:34,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8295019157088123 [2025-03-08 21:36:34,618 INFO L175 Difference]: Start difference. First operand has 168 places, 181 transitions, 593 flow. Second operand 3 states and 433 transitions. [2025-03-08 21:36:34,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 194 transitions, 765 flow [2025-03-08 21:36:34,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 194 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:34,669 INFO L231 Difference]: Finished difference. Result has 170 places, 191 transitions, 705 flow [2025-03-08 21:36:34,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=170, PETRI_TRANSITIONS=191} [2025-03-08 21:36:34,670 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -4 predicate places. [2025-03-08 21:36:34,670 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 191 transitions, 705 flow [2025-03-08 21:36:34,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:34,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:34,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:34,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:36:34,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:34,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:34,671 INFO L85 PathProgramCache]: Analyzing trace with hash 443070984, now seen corresponding path program 1 times [2025-03-08 21:36:34,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:34,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054859112] [2025-03-08 21:36:34,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:34,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:34,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 21:36:34,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 21:36:34,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:34,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:34,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054859112] [2025-03-08 21:36:34,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054859112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:34,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:34,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157601340] [2025-03-08 21:36:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:34,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:34,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:34,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:34,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 174 [2025-03-08 21:36:34,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 191 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:34,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:34,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 174 [2025-03-08 21:36:34,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:36,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][201], [172#L718-1true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 173#L699-1true, 219#true, 69#L708-2true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 141#L700-3true, 180#true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 176#L708-1true, 226#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:36,507 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-08 21:36:36,507 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-08 21:36:36,507 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-08 21:36:36,507 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-08 21:36:36,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][144], [172#L718-1true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 219#true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), 69#L708-2true, Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 180#true, 67#L700-3true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 45#L700-4true, 176#L708-1true, 226#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:36,734 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-08 21:36:36,734 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-08 21:36:36,734 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-08 21:36:36,734 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-08 21:36:36,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][144], [172#L718-1true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 219#true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), 69#L708-2true, Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 141#L700-3true, 180#true, 135#L700-4true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 176#L708-1true, 226#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:36,752 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-08 21:36:36,752 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-08 21:36:36,752 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-08 21:36:36,752 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-08 21:36:36,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][201], [172#L718-1true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 173#L699-1true, 219#true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), 69#L708-2true, Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 49#L700true, 180#true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 226#(= |#race~y~0| 0), 176#L708-1true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:36,773 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-08 21:36:36,773 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-08 21:36:36,773 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-08 21:36:36,773 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-08 21:36:36,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][200], [130#L699-1true, 172#L718-1true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 153#writerErr0ASSERT_VIOLATIONDATA_RACEtrue, 219#true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), 69#L708-2true, Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 180#true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 226#(= |#race~y~0| 0), 176#L708-1true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:36,834 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-08 21:36:36,834 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-08 21:36:36,834 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-08 21:36:36,834 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-08 21:36:36,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][144], [172#L718-1true, 37#L700true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 219#true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), 69#L708-2true, Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 180#true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 45#L700-4true, 176#L708-1true, 226#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:36,961 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-08 21:36:36,961 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-08 21:36:36,961 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-08 21:36:36,961 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-08 21:36:37,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][144], [172#L718-1true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 219#true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), 69#L708-2true, Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 49#L700true, 180#true, 135#L700-4true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 226#(= |#race~y~0| 0), 176#L708-1true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:37,015 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-08 21:36:37,015 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-08 21:36:37,015 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-08 21:36:37,015 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-08 21:36:37,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][144], [172#L718-1true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 219#true, 69#L708-2true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 180#true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 58#L700-1true, 45#L700-4true, 226#(= |#race~y~0| 0), 176#L708-1true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:37,072 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-08 21:36:37,072 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-08 21:36:37,072 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-08 21:36:37,072 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-08 21:36:37,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][144], [172#L718-1true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 153#writerErr0ASSERT_VIOLATIONDATA_RACEtrue, 219#true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), 69#L708-2true, Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 180#true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 45#L700-4true, 176#L708-1true, 226#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:37,088 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-08 21:36:37,088 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-08 21:36:37,088 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-08 21:36:37,088 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-08 21:36:37,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][144], [24#L701true, 172#L718-1true, Black: 193#true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 219#true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), 69#L708-2true, Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 180#true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 45#L700-4true, 226#(= |#race~y~0| 0), 176#L708-1true, Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:37,176 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-08 21:36:37,176 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-08 21:36:37,176 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-08 21:36:37,176 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-08 21:36:37,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L708-4-->L708-2: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][144], [Black: 193#true, 44#L720true, Black: 200#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 186#true, 219#true, 69#L708-2true, Black: 206#(and (= ~r~0 0) (= ~w~0 0)), Black: 207#(and (<= 1 ~r~0) (= ~w~0 0)), 180#true, Black: 216#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 45#L700-4true, 176#L708-1true, 226#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), Black: 190#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|)]) [2025-03-08 21:36:37,614 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-03-08 21:36:37,614 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-08 21:36:37,614 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-08 21:36:37,614 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-08 21:36:38,463 INFO L124 PetriNetUnfolderBase]: 9119/53734 cut-off events. [2025-03-08 21:36:38,464 INFO L125 PetriNetUnfolderBase]: For 30640/34398 co-relation queries the response was YES. [2025-03-08 21:36:38,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98737 conditions, 53734 events. 9119/53734 cut-off events. For 30640/34398 co-relation queries the response was YES. Maximal size of possible extension queue 2444. Compared 906666 event pairs, 1957 based on Foata normal form. 247/45329 useless extension candidates. Maximal degree in co-relation 98726. Up to 7235 conditions per place. [2025-03-08 21:36:38,883 INFO L140 encePairwiseOnDemand]: 166/174 looper letters, 39 selfloop transitions, 7 changer transitions 0/209 dead transitions. [2025-03-08 21:36:38,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 209 transitions, 875 flow [2025-03-08 21:36:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-03-08 21:36:38,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8505747126436781 [2025-03-08 21:36:38,884 INFO L175 Difference]: Start difference. First operand has 170 places, 191 transitions, 705 flow. Second operand 3 states and 444 transitions. [2025-03-08 21:36:38,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 209 transitions, 875 flow [2025-03-08 21:36:38,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 209 transitions, 835 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:38,953 INFO L231 Difference]: Finished difference. Result has 172 places, 197 transitions, 727 flow [2025-03-08 21:36:38,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=727, PETRI_PLACES=172, PETRI_TRANSITIONS=197} [2025-03-08 21:36:38,953 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -2 predicate places. [2025-03-08 21:36:38,954 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 197 transitions, 727 flow [2025-03-08 21:36:38,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:36:38,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:38,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:38,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:36:38,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-08 21:36:38,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:38,954 INFO L85 PathProgramCache]: Analyzing trace with hash 513519320, now seen corresponding path program 1 times [2025-03-08 21:36:38,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:38,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919271164] [2025-03-08 21:36:38,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:38,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 21:36:38,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 21:36:38,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:38,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:36:38,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:36:38,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 21:36:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 21:36:38,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:38,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:36:38,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:36:38,993 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:36:38,994 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location writerErr0ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-03-08 21:36:39,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-03-08 21:36:39,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-03-08 21:36:39,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-03-08 21:36:39,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-03-08 21:36:39,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-03-08 21:36:39,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-03-08 21:36:39,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-03-08 21:36:39,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-03-08 21:36:39,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-03-08 21:36:39,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-03-08 21:36:39,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-03-08 21:36:39,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-03-08 21:36:39,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-03-08 21:36:39,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:36:39,002 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:39,037 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:36:39,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:36:39,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:36:39 BasicIcfg [2025-03-08 21:36:39,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:36:39,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:36:39,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:36:39,044 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:36:39,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:18" (3/4) ... [2025-03-08 21:36:39,046 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:36:39,092 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-03-08 21:36:39,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:36:39,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:36:39,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:36:39,131 INFO L158 Benchmark]: Toolchain (without parser) took 21069.66ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 132.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-08 21:36:39,132 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:36:39,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.78ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 112.6MB in the end (delta: 19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:36:39,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.00ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:36:39,133 INFO L158 Benchmark]: Boogie Preprocessor took 12.86ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.7MB in the end (delta: 822.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:36:39,134 INFO L158 Benchmark]: IcfgBuilder took 418.91ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 88.6MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:36:39,134 INFO L158 Benchmark]: TraceAbstraction took 20175.45ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 88.0MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-08 21:36:39,134 INFO L158 Benchmark]: Witness Printer took 85.50ms. Allocated memory is still 2.8GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:36:39,135 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.78ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 112.6MB in the end (delta: 19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.00ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.86ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.7MB in the end (delta: 822.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 418.91ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 88.6MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20175.45ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 88.0MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 85.50ms. Allocated memory is still 2.8GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 700]: Data race detected Data race detected The following path leads to a data race: [L688] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L714] 0 pthread_t t1, t2, t3, t4; VAL [r=0, w=0, x=0, y=0] [L715] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-1, w=0, x=0, y=0] [L716] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-1, t2=0, w=0, x=0, y=0] [L704] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L698] CALL 1 __VERIFIER_atomic_take_write_lock() [L690] EXPR 1 w==0 [L690] EXPR 1 w==0 && r==0 [L690] EXPR 1 r==0 [L690] EXPR 1 w==0 && r==0 [L690] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L690] RET 1 assume_abort_if_not(w==0 && r==0) [L691] 1 w = 1 [L698] RET 1 __VERIFIER_atomic_take_write_lock() [L699] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L700] 1 w = 0 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=3, y=0] [L705] CALL 2 __VERIFIER_atomic_take_read_lock() [L694] EXPR 2 w==0 [L694] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L694] RET 2 assume_abort_if_not(w==0) [L695] EXPR 2 r+1 [L695] 2 r = r+1 [L705] RET 2 __VERIFIER_atomic_take_read_lock() [L700] 1 w = 0 VAL [\old(arg)={0:0}, arg={0:0}, r=1, w=0, x=3, y=0] Now there is a data race on ~w~0 between C: w==0 [694] and C: w = 0 [700] - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: 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: 718]: 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: 715]: 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: 717]: 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: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: 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 7 procedures, 236 locations, 243 edges, 46 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: 20.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 420 IncrementalHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 56 mSDtfsCounter, 420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=727occurred in iteration=9, InterpolantAutomatonStates: 28, 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, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-08 21:36:39,152 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)