./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:33:03,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:33:03,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:33:03,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:33:03,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:33:03,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:33:03,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:33:03,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:33:03,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:33:03,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:33:03,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:33:03,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:33:03,513 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:33:03,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:33:03,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:33:03,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:33:03,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:33:03,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:33:03,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:33:03,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:33:03,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:33:03,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:33:03,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:33:03,516 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-jdk21/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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2025-02-06 09:33:03,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:33:03,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:33:03,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:33:03,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:33:03,744 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:33:03,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-02-06 09:33:04,917 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2313b9b2f/24ae9e34357448ed8714a3b3a64e5e5c/FLAGde86c0035 [2025-02-06 09:33:05,194 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:33:05,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-02-06 09:33:05,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2313b9b2f/24ae9e34357448ed8714a3b3a64e5e5c/FLAGde86c0035 [2025-02-06 09:33:05,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2313b9b2f/24ae9e34357448ed8714a3b3a64e5e5c [2025-02-06 09:33:05,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:33:05,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:33:05,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:33:05,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:33:05,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:33:05,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc0aa8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05, skipping insertion in model container [2025-02-06 09:33:05,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:33:05,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:33:05,797 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:33:05,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:33:05,860 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:33:05,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05 WrapperNode [2025-02-06 09:33:05,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:33:05,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:33:05,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:33:05,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:33:05,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,888 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 228 [2025-02-06 09:33:05,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:33:05,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:33:05,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:33:05,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:33:05,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,908 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:33:05,914 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:33:05,914 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:33:05,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:33:05,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (1/1) ... [2025-02-06 09:33:05,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:33:05,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:33:05,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:33:05,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:33:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:33:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 09:33:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 09:33:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 09:33:05,969 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 09:33:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:33:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:33:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:33:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:33:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:33:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:33:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:33:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:33:05,971 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:33:06,055 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:33:06,056 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:33:06,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem7#1; [2025-02-06 09:33:06,372 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:33:06,375 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:33:06,406 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:33:06,406 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:33:06,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:33:06 BoogieIcfgContainer [2025-02-06 09:33:06,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:33:06,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:33:06,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:33:06,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:33:06,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:33:05" (1/3) ... [2025-02-06 09:33:06,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25efb3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:33:06, skipping insertion in model container [2025-02-06 09:33:06,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:33:05" (2/3) ... [2025-02-06 09:33:06,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25efb3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:33:06, skipping insertion in model container [2025-02-06 09:33:06,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:33:06" (3/3) ... [2025-02-06 09:33:06,416 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-02-06 09:33:06,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:33:06,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 264 locations, 1 initial locations, 2 loop locations, and 29 error locations. [2025-02-06 09:33:06,431 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:33:06,496 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:33:06,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 275 transitions, 564 flow [2025-02-06 09:33:06,623 INFO L124 PetriNetUnfolderBase]: 12/273 cut-off events. [2025-02-06 09:33:06,628 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:33:06,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 273 events. 12/273 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 663 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 188. Up to 2 conditions per place. [2025-02-06 09:33:06,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 275 transitions, 564 flow [2025-02-06 09:33:06,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 268 transitions, 545 flow [2025-02-06 09:33:06,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:33:06,663 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;@3a4f314f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:33:06,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-02-06 09:33:06,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:33:06,676 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-02-06 09:33:06,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:33:06,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:06,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:06,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:06,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash 574729884, now seen corresponding path program 1 times [2025-02-06 09:33:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:06,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628337890] [2025-02-06 09:33:06,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:06,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 09:33:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 09:33:06,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:06,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:06,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:06,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628337890] [2025-02-06 09:33:06,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628337890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:06,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:06,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:06,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803951634] [2025-02-06 09:33:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:06,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:06,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:06,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:06,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:06,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 275 [2025-02-06 09:33:06,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 268 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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-02-06 09:33:06,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:06,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 275 [2025-02-06 09:33:06,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:07,003 INFO L124 PetriNetUnfolderBase]: 55/645 cut-off events. [2025-02-06 09:33:07,003 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 09:33:07,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 645 events. 55/645 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3368 event pairs, 27 based on Foata normal form. 17/548 useless extension candidates. Maximal degree in co-relation 630. Up to 79 conditions per place. [2025-02-06 09:33:07,010 INFO L140 encePairwiseOnDemand]: 268/275 looper letters, 16 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-02-06 09:33:07,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 563 flow [2025-02-06 09:33:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2025-02-06 09:33:07,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-02-06 09:33:07,029 INFO L175 Difference]: Start difference. First operand has 263 places, 268 transitions, 545 flow. Second operand 3 states and 770 transitions. [2025-02-06 09:33:07,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 259 transitions, 563 flow [2025-02-06 09:33:07,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 259 transitions, 558 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 09:33:07,037 INFO L231 Difference]: Finished difference. Result has 257 places, 259 transitions, 526 flow [2025-02-06 09:33:07,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=257, PETRI_TRANSITIONS=259} [2025-02-06 09:33:07,043 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -6 predicate places. [2025-02-06 09:33:07,043 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 259 transitions, 526 flow [2025-02-06 09:33:07,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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-02-06 09:33:07,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:07,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:07,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:33:07,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash 590102702, now seen corresponding path program 1 times [2025-02-06 09:33:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:07,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292458343] [2025-02-06 09:33:07,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:07,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:07,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 09:33:07,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 09:33:07,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:07,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:07,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:07,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292458343] [2025-02-06 09:33:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292458343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:07,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:07,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:07,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798837687] [2025-02-06 09:33:07,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:07,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:07,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:07,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:07,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:07,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 275 [2025-02-06 09:33:07,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 259 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-02-06 09:33:07,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:07,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 275 [2025-02-06 09:33:07,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:07,325 INFO L124 PetriNetUnfolderBase]: 59/648 cut-off events. [2025-02-06 09:33:07,326 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 09:33:07,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 648 events. 59/648 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3447 event pairs, 31 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 707. Up to 89 conditions per place. [2025-02-06 09:33:07,330 INFO L140 encePairwiseOnDemand]: 272/275 looper letters, 18 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2025-02-06 09:33:07,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 258 transitions, 564 flow [2025-02-06 09:33:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2025-02-06 09:33:07,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236363636363636 [2025-02-06 09:33:07,332 INFO L175 Difference]: Start difference. First operand has 257 places, 259 transitions, 526 flow. Second operand 3 states and 762 transitions. [2025-02-06 09:33:07,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 258 transitions, 564 flow [2025-02-06 09:33:07,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 258 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:07,338 INFO L231 Difference]: Finished difference. Result has 256 places, 258 transitions, 524 flow [2025-02-06 09:33:07,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=256, PETRI_TRANSITIONS=258} [2025-02-06 09:33:07,339 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -7 predicate places. [2025-02-06 09:33:07,341 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 258 transitions, 524 flow [2025-02-06 09:33:07,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-02-06 09:33:07,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:07,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:07,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:33:07,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:07,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash 153029991, now seen corresponding path program 1 times [2025-02-06 09:33:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699493737] [2025-02-06 09:33:07,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:07,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:07,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 09:33:07,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 09:33:07,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:07,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:07,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699493737] [2025-02-06 09:33:07,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699493737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:07,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:07,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:07,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244510197] [2025-02-06 09:33:07,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:07,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:07,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:07,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:07,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:07,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 275 [2025-02-06 09:33:07,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 258 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-02-06 09:33:07,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:07,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 275 [2025-02-06 09:33:07,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:07,625 INFO L124 PetriNetUnfolderBase]: 125/1218 cut-off events. [2025-02-06 09:33:07,625 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-06 09:33:07,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1218 events. 125/1218 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7664 event pairs, 54 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1372. Up to 170 conditions per place. [2025-02-06 09:33:07,636 INFO L140 encePairwiseOnDemand]: 264/275 looper letters, 23 selfloop transitions, 5 changer transitions 0/259 dead transitions. [2025-02-06 09:33:07,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 259 transitions, 584 flow [2025-02-06 09:33:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2025-02-06 09:33:07,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9175757575757576 [2025-02-06 09:33:07,639 INFO L175 Difference]: Start difference. First operand has 256 places, 258 transitions, 524 flow. Second operand 3 states and 757 transitions. [2025-02-06 09:33:07,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 259 transitions, 584 flow [2025-02-06 09:33:07,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 259 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:07,644 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 544 flow [2025-02-06 09:33:07,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2025-02-06 09:33:07,646 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -10 predicate places. [2025-02-06 09:33:07,646 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 544 flow [2025-02-06 09:33:07,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-02-06 09:33:07,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:07,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:07,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:33:07,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:07,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:07,647 INFO L85 PathProgramCache]: Analyzing trace with hash 526806732, now seen corresponding path program 1 times [2025-02-06 09:33:07,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:07,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870904341] [2025-02-06 09:33:07,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:07,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 09:33:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 09:33:07,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:07,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:07,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870904341] [2025-02-06 09:33:07,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870904341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:07,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:07,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:07,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012089450] [2025-02-06 09:33:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:07,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:07,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:07,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:07,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:07,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 275 [2025-02-06 09:33:07,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 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-02-06 09:33:07,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:07,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 275 [2025-02-06 09:33:07,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:07,846 INFO L124 PetriNetUnfolderBase]: 79/1078 cut-off events. [2025-02-06 09:33:07,846 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-06 09:33:07,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 1078 events. 79/1078 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6093 event pairs, 24 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1038. Up to 82 conditions per place. [2025-02-06 09:33:07,850 INFO L140 encePairwiseOnDemand]: 272/275 looper letters, 15 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-02-06 09:33:07,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 255 transitions, 576 flow [2025-02-06 09:33:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2025-02-06 09:33:07,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9309090909090909 [2025-02-06 09:33:07,852 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 544 flow. Second operand 3 states and 768 transitions. [2025-02-06 09:33:07,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 255 transitions, 576 flow [2025-02-06 09:33:07,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 255 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:07,856 INFO L231 Difference]: Finished difference. Result has 252 places, 255 transitions, 536 flow [2025-02-06 09:33:07,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=252, PETRI_TRANSITIONS=255} [2025-02-06 09:33:07,857 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -11 predicate places. [2025-02-06 09:33:07,857 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 255 transitions, 536 flow [2025-02-06 09:33:07,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 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-02-06 09:33:07,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:07,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:07,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:33:07,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:07,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:07,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1512986909, now seen corresponding path program 1 times [2025-02-06 09:33:07,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:07,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894097652] [2025-02-06 09:33:07,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:07,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:07,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 09:33:07,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 09:33:07,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:07,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:07,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:07,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894097652] [2025-02-06 09:33:07,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894097652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:07,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:07,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:07,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525571054] [2025-02-06 09:33:07,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:07,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:07,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:07,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:07,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:07,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 275 [2025-02-06 09:33:07,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 255 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-02-06 09:33:07,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:07,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 275 [2025-02-06 09:33:07,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:07,996 INFO L124 PetriNetUnfolderBase]: 63/839 cut-off events. [2025-02-06 09:33:07,996 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:33:07,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 839 events. 63/839 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3980 event pairs, 22 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 887. Up to 69 conditions per place. [2025-02-06 09:33:08,000 INFO L140 encePairwiseOnDemand]: 272/275 looper letters, 13 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-02-06 09:33:08,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 254 transitions, 564 flow [2025-02-06 09:33:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2025-02-06 09:33:08,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9321212121212121 [2025-02-06 09:33:08,002 INFO L175 Difference]: Start difference. First operand has 252 places, 255 transitions, 536 flow. Second operand 3 states and 769 transitions. [2025-02-06 09:33:08,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 254 transitions, 564 flow [2025-02-06 09:33:08,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 254 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:08,007 INFO L231 Difference]: Finished difference. Result has 251 places, 254 transitions, 534 flow [2025-02-06 09:33:08,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=251, PETRI_TRANSITIONS=254} [2025-02-06 09:33:08,008 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -12 predicate places. [2025-02-06 09:33:08,008 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 254 transitions, 534 flow [2025-02-06 09:33:08,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-02-06 09:33:08,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:08,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:08,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:33:08,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:08,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash 869503818, now seen corresponding path program 1 times [2025-02-06 09:33:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:08,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217166236] [2025-02-06 09:33:08,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:08,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 09:33:08,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 09:33:08,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:08,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:08,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:08,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217166236] [2025-02-06 09:33:08,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217166236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:08,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:08,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:08,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173675060] [2025-02-06 09:33:08,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:08,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:08,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:08,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 275 [2025-02-06 09:33:08,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 254 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-02-06 09:33:08,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:08,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 275 [2025-02-06 09:33:08,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:08,161 INFO L124 PetriNetUnfolderBase]: 68/918 cut-off events. [2025-02-06 09:33:08,161 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 09:33:08,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 918 events. 68/918 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4611 event pairs, 22 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 961. Up to 71 conditions per place. [2025-02-06 09:33:08,167 INFO L140 encePairwiseOnDemand]: 272/275 looper letters, 13 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-02-06 09:33:08,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 253 transitions, 562 flow [2025-02-06 09:33:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2025-02-06 09:33:08,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9321212121212121 [2025-02-06 09:33:08,169 INFO L175 Difference]: Start difference. First operand has 251 places, 254 transitions, 534 flow. Second operand 3 states and 769 transitions. [2025-02-06 09:33:08,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 253 transitions, 562 flow [2025-02-06 09:33:08,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 253 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:08,173 INFO L231 Difference]: Finished difference. Result has 250 places, 253 transitions, 532 flow [2025-02-06 09:33:08,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=250, PETRI_TRANSITIONS=253} [2025-02-06 09:33:08,175 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2025-02-06 09:33:08,175 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 253 transitions, 532 flow [2025-02-06 09:33:08,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-02-06 09:33:08,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:08,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:08,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:33:08,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:08,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:08,177 INFO L85 PathProgramCache]: Analyzing trace with hash 16339273, now seen corresponding path program 1 times [2025-02-06 09:33:08,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:08,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403793162] [2025-02-06 09:33:08,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:08,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:08,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 09:33:08,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 09:33:08,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:08,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403793162] [2025-02-06 09:33:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403793162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:08,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996572375] [2025-02-06 09:33:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:08,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:08,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:08,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 275 [2025-02-06 09:33:08,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 253 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 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-02-06 09:33:08,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:08,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 275 [2025-02-06 09:33:08,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:08,389 INFO L124 PetriNetUnfolderBase]: 110/1251 cut-off events. [2025-02-06 09:33:08,389 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:33:08,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 1251 events. 110/1251 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7237 event pairs, 20 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1378. Up to 87 conditions per place. [2025-02-06 09:33:08,397 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 19 selfloop transitions, 4 changer transitions 0/263 dead transitions. [2025-02-06 09:33:08,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 263 transitions, 601 flow [2025-02-06 09:33:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2025-02-06 09:33:08,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563636363636364 [2025-02-06 09:33:08,399 INFO L175 Difference]: Start difference. First operand has 250 places, 253 transitions, 532 flow. Second operand 3 states and 789 transitions. [2025-02-06 09:33:08,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 263 transitions, 601 flow [2025-02-06 09:33:08,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 263 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:08,403 INFO L231 Difference]: Finished difference. Result has 252 places, 257 transitions, 562 flow [2025-02-06 09:33:08,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=252, PETRI_TRANSITIONS=257} [2025-02-06 09:33:08,404 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -11 predicate places. [2025-02-06 09:33:08,404 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 257 transitions, 562 flow [2025-02-06 09:33:08,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 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-02-06 09:33:08,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:08,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:08,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:33:08,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:08,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1575257364, now seen corresponding path program 1 times [2025-02-06 09:33:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17665104] [2025-02-06 09:33:08,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:08,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:33:08,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:33:08,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:08,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17665104] [2025-02-06 09:33:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17665104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:08,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158317345] [2025-02-06 09:33:08,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:08,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:08,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:08,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:08,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 275 [2025-02-06 09:33:08,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 257 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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-02-06 09:33:08,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:08,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 275 [2025-02-06 09:33:08,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:08,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][247], [211#L726true, 25#L750true, 298#true, 269#true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 92#L762-1true, 293#true]) [2025-02-06 09:33:08,706 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-02-06 09:33:08,707 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-06 09:33:08,710 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-06 09:33:08,710 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-06 09:33:08,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][247], [25#L750true, 298#true, 269#true, Black: 295#(= |#race~send~0| 0), 259#L764true, Black: 279#true, 293#true]) [2025-02-06 09:33:08,714 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-02-06 09:33:08,714 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-02-06 09:33:08,714 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-06 09:33:08,714 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-02-06 09:33:08,769 INFO L124 PetriNetUnfolderBase]: 217/2261 cut-off events. [2025-02-06 09:33:08,769 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-06 09:33:08,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 2261 events. 217/2261 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16444 event pairs, 41 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2483. Up to 161 conditions per place. [2025-02-06 09:33:08,789 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 18 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2025-02-06 09:33:08,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 266 transitions, 625 flow [2025-02-06 09:33:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-02-06 09:33:08,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9551515151515152 [2025-02-06 09:33:08,791 INFO L175 Difference]: Start difference. First operand has 252 places, 257 transitions, 562 flow. Second operand 3 states and 788 transitions. [2025-02-06 09:33:08,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 266 transitions, 625 flow [2025-02-06 09:33:08,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 266 transitions, 617 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:08,797 INFO L231 Difference]: Finished difference. Result has 254 places, 261 transitions, 588 flow [2025-02-06 09:33:08,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=254, PETRI_TRANSITIONS=261} [2025-02-06 09:33:08,798 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -9 predicate places. [2025-02-06 09:33:08,798 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 261 transitions, 588 flow [2025-02-06 09:33:08,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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-02-06 09:33:08,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:08,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:08,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:33:08,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:08,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1003269884, now seen corresponding path program 1 times [2025-02-06 09:33:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:08,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001452552] [2025-02-06 09:33:08,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:08,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:08,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:33:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:33:08,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:08,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001452552] [2025-02-06 09:33:08,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001452552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:08,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:08,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:08,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981425943] [2025-02-06 09:33:08,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:08,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:08,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:08,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:08,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:08,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 275 [2025-02-06 09:33:08,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 261 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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-02-06 09:33:08,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:08,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 275 [2025-02-06 09:33:08,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:09,212 INFO L124 PetriNetUnfolderBase]: 464/4095 cut-off events. [2025-02-06 09:33:09,212 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-06 09:33:09,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5082 conditions, 4095 events. 464/4095 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 38312 event pairs, 115 based on Foata normal form. 0/3529 useless extension candidates. Maximal degree in co-relation 4787. Up to 523 conditions per place. [2025-02-06 09:33:09,229 INFO L140 encePairwiseOnDemand]: 268/275 looper letters, 24 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-02-06 09:33:09,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 264 transitions, 649 flow [2025-02-06 09:33:09,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2025-02-06 09:33:09,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9284848484848485 [2025-02-06 09:33:09,231 INFO L175 Difference]: Start difference. First operand has 254 places, 261 transitions, 588 flow. Second operand 3 states and 766 transitions. [2025-02-06 09:33:09,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 264 transitions, 649 flow [2025-02-06 09:33:09,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 264 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:09,237 INFO L231 Difference]: Finished difference. Result has 250 places, 258 transitions, 584 flow [2025-02-06 09:33:09,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=250, PETRI_TRANSITIONS=258} [2025-02-06 09:33:09,237 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2025-02-06 09:33:09,238 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 258 transitions, 584 flow [2025-02-06 09:33:09,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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-02-06 09:33:09,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:09,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:09,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:33:09,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:09,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:09,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1081607367, now seen corresponding path program 1 times [2025-02-06 09:33:09,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:09,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608023176] [2025-02-06 09:33:09,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:09,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:33:09,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:33:09,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:09,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:09,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:09,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608023176] [2025-02-06 09:33:09,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608023176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:09,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:09,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:09,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081026919] [2025-02-06 09:33:09,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:09,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:09,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:09,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:09,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 275 [2025-02-06 09:33:09,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 258 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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-02-06 09:33:09,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:09,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 275 [2025-02-06 09:33:09,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:09,777 INFO L124 PetriNetUnfolderBase]: 668/5213 cut-off events. [2025-02-06 09:33:09,778 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-02-06 09:33:09,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6686 conditions, 5213 events. 668/5213 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 49735 event pairs, 119 based on Foata normal form. 0/4602 useless extension candidates. Maximal degree in co-relation 6429. Up to 598 conditions per place. [2025-02-06 09:33:09,801 INFO L140 encePairwiseOnDemand]: 268/275 looper letters, 18 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2025-02-06 09:33:09,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 262 transitions, 637 flow [2025-02-06 09:33:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2025-02-06 09:33:09,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2025-02-06 09:33:09,803 INFO L175 Difference]: Start difference. First operand has 250 places, 258 transitions, 584 flow. Second operand 3 states and 775 transitions. [2025-02-06 09:33:09,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 262 transitions, 637 flow [2025-02-06 09:33:09,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 262 transitions, 637 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:33:09,806 INFO L231 Difference]: Finished difference. Result has 250 places, 257 transitions, 598 flow [2025-02-06 09:33:09,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=250, PETRI_TRANSITIONS=257} [2025-02-06 09:33:09,807 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2025-02-06 09:33:09,808 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 257 transitions, 598 flow [2025-02-06 09:33:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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-02-06 09:33:09,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:09,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:09,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:33:09,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:09,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash 721913424, now seen corresponding path program 1 times [2025-02-06 09:33:09,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:09,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899016698] [2025-02-06 09:33:09,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:09,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:09,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:33:09,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:33:09,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:09,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:09,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:09,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899016698] [2025-02-06 09:33:09,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899016698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:09,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:09,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:33:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818481772] [2025-02-06 09:33:09,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:09,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:09,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:09,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:09,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 275 [2025-02-06 09:33:09,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 257 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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-02-06 09:33:09,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:09,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 275 [2025-02-06 09:33:09,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:10,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [211#L726true, Black: 303#true, 25#L750true, Black: 307#true, 309#(= |#race~first~0| 0), 269#true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 92#L762-1true, Black: 300#(= |#race~receive~0| 0), 311#true, 305#(= |#race~buffer_size~0| 0)]) [2025-02-06 09:33:10,231 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-02-06 09:33:10,231 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-06 09:33:10,231 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:33:10,231 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-06 09:33:10,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [25#L750true, Black: 303#true, Black: 307#true, 309#(= |#race~first~0| 0), 269#true, Black: 295#(= |#race~send~0| 0), 259#L764true, Black: 279#true, 311#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0)]) [2025-02-06 09:33:10,247 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-02-06 09:33:10,247 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-06 09:33:10,247 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-06 09:33:10,247 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:33:10,307 INFO L124 PetriNetUnfolderBase]: 685/4850 cut-off events. [2025-02-06 09:33:10,307 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-06 09:33:10,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 4850 events. 685/4850 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 45124 event pairs, 291 based on Foata normal form. 0/4248 useless extension candidates. Maximal degree in co-relation 6198. Up to 816 conditions per place. [2025-02-06 09:33:10,334 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 18 selfloop transitions, 3 changer transitions 0/261 dead transitions. [2025-02-06 09:33:10,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 650 flow [2025-02-06 09:33:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2025-02-06 09:33:10,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2025-02-06 09:33:10,336 INFO L175 Difference]: Start difference. First operand has 250 places, 257 transitions, 598 flow. Second operand 3 states and 775 transitions. [2025-02-06 09:33:10,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 650 flow [2025-02-06 09:33:10,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 261 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:33:10,340 INFO L231 Difference]: Finished difference. Result has 253 places, 258 transitions, 612 flow [2025-02-06 09:33:10,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=253, PETRI_TRANSITIONS=258} [2025-02-06 09:33:10,340 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -10 predicate places. [2025-02-06 09:33:10,341 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 258 transitions, 612 flow [2025-02-06 09:33:10,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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-02-06 09:33:10,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:10,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:10,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:33:10,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -322006333, now seen corresponding path program 1 times [2025-02-06 09:33:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:10,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151274699] [2025-02-06 09:33:10,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 09:33:10,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 09:33:10,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:10,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:10,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:10,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151274699] [2025-02-06 09:33:10,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151274699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:10,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:10,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:10,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693717513] [2025-02-06 09:33:10,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:10,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:10,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:10,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:10,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:10,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 275 [2025-02-06 09:33:10,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 258 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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-02-06 09:33:10,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:10,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 275 [2025-02-06 09:33:10,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:10,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [316#true, 269#true, Black: 295#(= |#race~send~0| 0), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, 211#L726true, Black: 303#true, 25#L750true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, 92#L762-1true]) [2025-02-06 09:33:10,883 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-02-06 09:33:10,883 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-06 09:33:10,883 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-06 09:33:10,883 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:33:10,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [25#L750true, Black: 303#true, 316#true, Black: 307#true, 269#true, Black: 295#(= |#race~send~0| 0), Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), 259#L764true, Black: 279#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true]) [2025-02-06 09:33:10,900 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-02-06 09:33:10,900 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-06 09:33:10,900 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:33:10,900 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-06 09:33:10,956 INFO L124 PetriNetUnfolderBase]: 750/5301 cut-off events. [2025-02-06 09:33:10,957 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-02-06 09:33:10,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7199 conditions, 5301 events. 750/5301 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 51312 event pairs, 284 based on Foata normal form. 0/4692 useless extension candidates. Maximal degree in co-relation 6889. Up to 853 conditions per place. [2025-02-06 09:33:10,985 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 21 selfloop transitions, 4 changer transitions 0/264 dead transitions. [2025-02-06 09:33:10,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 264 transitions, 676 flow [2025-02-06 09:33:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-02-06 09:33:10,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936969696969697 [2025-02-06 09:33:10,987 INFO L175 Difference]: Start difference. First operand has 253 places, 258 transitions, 612 flow. Second operand 3 states and 773 transitions. [2025-02-06 09:33:10,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 264 transitions, 676 flow [2025-02-06 09:33:10,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 264 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:10,992 INFO L231 Difference]: Finished difference. Result has 255 places, 261 transitions, 636 flow [2025-02-06 09:33:10,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=255, PETRI_TRANSITIONS=261} [2025-02-06 09:33:10,992 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -8 predicate places. [2025-02-06 09:33:10,992 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 261 transitions, 636 flow [2025-02-06 09:33:10,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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-02-06 09:33:10,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:10,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:10,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:33:10,993 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:10,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1101985239, now seen corresponding path program 1 times [2025-02-06 09:33:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059107738] [2025-02-06 09:33:10,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:11,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 09:33:11,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 09:33:11,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:11,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059107738] [2025-02-06 09:33:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059107738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:11,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:11,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:33:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471222130] [2025-02-06 09:33:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:11,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:11,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:11,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:11,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 275 [2025-02-06 09:33:11,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 261 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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-02-06 09:33:11,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:11,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 275 [2025-02-06 09:33:11,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:11,465 INFO L124 PetriNetUnfolderBase]: 759/5667 cut-off events. [2025-02-06 09:33:11,465 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-02-06 09:33:11,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 5667 events. 759/5667 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 54528 event pairs, 306 based on Foata normal form. 0/5018 useless extension candidates. Maximal degree in co-relation 7581. Up to 945 conditions per place. [2025-02-06 09:33:11,491 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 18 selfloop transitions, 3 changer transitions 0/264 dead transitions. [2025-02-06 09:33:11,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 264 transitions, 683 flow [2025-02-06 09:33:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2025-02-06 09:33:11,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2025-02-06 09:33:11,493 INFO L175 Difference]: Start difference. First operand has 255 places, 261 transitions, 636 flow. Second operand 3 states and 775 transitions. [2025-02-06 09:33:11,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 264 transitions, 683 flow [2025-02-06 09:33:11,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 264 transitions, 673 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:11,498 INFO L231 Difference]: Finished difference. Result has 257 places, 261 transitions, 640 flow [2025-02-06 09:33:11,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=257, PETRI_TRANSITIONS=261} [2025-02-06 09:33:11,499 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -6 predicate places. [2025-02-06 09:33:11,499 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 261 transitions, 640 flow [2025-02-06 09:33:11,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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-02-06 09:33:11,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:11,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:11,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:33:11,500 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:11,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash 223578550, now seen corresponding path program 1 times [2025-02-06 09:33:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575027846] [2025-02-06 09:33:11,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:11,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:33:11,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:33:11,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:11,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:11,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:11,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575027846] [2025-02-06 09:33:11,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575027846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:11,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:11,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099240758] [2025-02-06 09:33:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:11,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:11,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:11,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:11,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 275 [2025-02-06 09:33:11,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 261 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-02-06 09:33:11,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:11,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 275 [2025-02-06 09:33:11,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:11,918 INFO L124 PetriNetUnfolderBase]: 521/4516 cut-off events. [2025-02-06 09:33:11,918 INFO L125 PetriNetUnfolderBase]: For 231/295 co-relation queries the response was YES. [2025-02-06 09:33:11,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 4516 events. 521/4516 cut-off events. For 231/295 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 41284 event pairs, 169 based on Foata normal form. 1/4058 useless extension candidates. Maximal degree in co-relation 5962. Up to 614 conditions per place. [2025-02-06 09:33:11,937 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 19 selfloop transitions, 5 changer transitions 0/267 dead transitions. [2025-02-06 09:33:11,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 267 transitions, 704 flow [2025-02-06 09:33:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2025-02-06 09:33:11,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2025-02-06 09:33:11,939 INFO L175 Difference]: Start difference. First operand has 257 places, 261 transitions, 640 flow. Second operand 3 states and 781 transitions. [2025-02-06 09:33:11,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 267 transitions, 704 flow [2025-02-06 09:33:11,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 267 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:11,944 INFO L231 Difference]: Finished difference. Result has 259 places, 264 transitions, 670 flow [2025-02-06 09:33:11,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=259, PETRI_TRANSITIONS=264} [2025-02-06 09:33:11,945 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -4 predicate places. [2025-02-06 09:33:11,945 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 264 transitions, 670 flow [2025-02-06 09:33:11,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-02-06 09:33:11,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:11,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:11,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:33:11,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:11,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1330923924, now seen corresponding path program 1 times [2025-02-06 09:33:11,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:11,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232545999] [2025-02-06 09:33:11,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:11,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:11,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 09:33:11,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 09:33:11,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:11,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:11,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232545999] [2025-02-06 09:33:11,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232545999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:11,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:11,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:11,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332545796] [2025-02-06 09:33:11,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:11,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:11,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:11,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:11,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:11,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 275 [2025-02-06 09:33:11,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 264 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-02-06 09:33:11,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:11,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 275 [2025-02-06 09:33:11,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:12,485 INFO L124 PetriNetUnfolderBase]: 666/5678 cut-off events. [2025-02-06 09:33:12,485 INFO L125 PetriNetUnfolderBase]: For 377/382 co-relation queries the response was YES. [2025-02-06 09:33:12,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8004 conditions, 5678 events. 666/5678 cut-off events. For 377/382 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 55368 event pairs, 200 based on Foata normal form. 1/5116 useless extension candidates. Maximal degree in co-relation 7724. Up to 765 conditions per place. [2025-02-06 09:33:12,512 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 19 selfloop transitions, 5 changer transitions 0/270 dead transitions. [2025-02-06 09:33:12,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 270 transitions, 733 flow [2025-02-06 09:33:12,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2025-02-06 09:33:12,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2025-02-06 09:33:12,514 INFO L175 Difference]: Start difference. First operand has 259 places, 264 transitions, 670 flow. Second operand 3 states and 781 transitions. [2025-02-06 09:33:12,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 270 transitions, 733 flow [2025-02-06 09:33:12,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 270 transitions, 721 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:12,521 INFO L231 Difference]: Finished difference. Result has 261 places, 267 transitions, 694 flow [2025-02-06 09:33:12,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=261, PETRI_TRANSITIONS=267} [2025-02-06 09:33:12,521 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -2 predicate places. [2025-02-06 09:33:12,522 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 267 transitions, 694 flow [2025-02-06 09:33:12,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-02-06 09:33:12,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:12,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:12,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:33:12,522 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:12,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1434461318, now seen corresponding path program 1 times [2025-02-06 09:33:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:12,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094673530] [2025-02-06 09:33:12,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:12,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 09:33:12,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 09:33:12,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:12,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:12,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:12,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094673530] [2025-02-06 09:33:12,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094673530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:12,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:12,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258865502] [2025-02-06 09:33:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:12,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:12,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:12,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:12,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:12,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 275 [2025-02-06 09:33:12,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 267 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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-02-06 09:33:12,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:12,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 275 [2025-02-06 09:33:12,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:12,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 269#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 331#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), 211#L726true, Black: 303#true, 25#L750true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, 92#L762-1true]) [2025-02-06 09:33:12,936 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-02-06 09:33:12,936 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-06 09:33:12,936 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:33:12,936 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-06 09:33:12,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 269#true, Black: 295#(= |#race~send~0| 0), 259#L764true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 331#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), 25#L750true, Black: 303#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true]) [2025-02-06 09:33:12,958 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-02-06 09:33:12,958 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-06 09:33:12,958 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:33:12,958 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-06 09:33:13,094 INFO L124 PetriNetUnfolderBase]: 707/6116 cut-off events. [2025-02-06 09:33:13,095 INFO L125 PetriNetUnfolderBase]: For 433/437 co-relation queries the response was YES. [2025-02-06 09:33:13,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8704 conditions, 6116 events. 707/6116 cut-off events. For 433/437 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 61223 event pairs, 243 based on Foata normal form. 0/5564 useless extension candidates. Maximal degree in co-relation 8429. Up to 869 conditions per place. [2025-02-06 09:33:13,113 INFO L140 encePairwiseOnDemand]: 272/275 looper letters, 19 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-02-06 09:33:13,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 269 transitions, 741 flow [2025-02-06 09:33:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2025-02-06 09:33:13,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345454545454546 [2025-02-06 09:33:13,115 INFO L175 Difference]: Start difference. First operand has 261 places, 267 transitions, 694 flow. Second operand 3 states and 771 transitions. [2025-02-06 09:33:13,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 269 transitions, 741 flow [2025-02-06 09:33:13,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 269 transitions, 729 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:13,122 INFO L231 Difference]: Finished difference. Result has 260 places, 266 transitions, 684 flow [2025-02-06 09:33:13,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=260, PETRI_TRANSITIONS=266} [2025-02-06 09:33:13,122 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -3 predicate places. [2025-02-06 09:33:13,122 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 266 transitions, 684 flow [2025-02-06 09:33:13,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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-02-06 09:33:13,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:13,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:13,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:33:13,123 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:13,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1869102059, now seen corresponding path program 1 times [2025-02-06 09:33:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939389682] [2025-02-06 09:33:13,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:13,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 09:33:13,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 09:33:13,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:13,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939389682] [2025-02-06 09:33:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939389682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996346531] [2025-02-06 09:33:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:13,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:13,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:13,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:13,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 275 [2025-02-06 09:33:13,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 266 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-02-06 09:33:13,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:13,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 275 [2025-02-06 09:33:13,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:13,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 269#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 339#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), 211#L726true, Black: 303#true, 25#L750true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, 92#L762-1true]) [2025-02-06 09:33:13,504 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-02-06 09:33:13,504 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-06 09:33:13,504 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:33:13,504 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-06 09:33:13,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 269#true, Black: 295#(= |#race~send~0| 0), 259#L764true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 339#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 25#L750true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true]) [2025-02-06 09:33:13,527 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-02-06 09:33:13,527 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-06 09:33:13,527 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:33:13,527 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-06 09:33:13,616 INFO L124 PetriNetUnfolderBase]: 721/6192 cut-off events. [2025-02-06 09:33:13,617 INFO L125 PetriNetUnfolderBase]: For 694/719 co-relation queries the response was YES. [2025-02-06 09:33:13,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8906 conditions, 6192 events. 721/6192 cut-off events. For 694/719 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 61669 event pairs, 185 based on Foata normal form. 5/5618 useless extension candidates. Maximal degree in co-relation 8612. Up to 804 conditions per place. [2025-02-06 09:33:13,651 INFO L140 encePairwiseOnDemand]: 269/275 looper letters, 19 selfloop transitions, 9 changer transitions 0/275 dead transitions. [2025-02-06 09:33:13,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 275 transitions, 772 flow [2025-02-06 09:33:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2025-02-06 09:33:13,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478787878787879 [2025-02-06 09:33:13,653 INFO L175 Difference]: Start difference. First operand has 260 places, 266 transitions, 684 flow. Second operand 3 states and 782 transitions. [2025-02-06 09:33:13,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 275 transitions, 772 flow [2025-02-06 09:33:13,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 275 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:13,660 INFO L231 Difference]: Finished difference. Result has 262 places, 272 transitions, 754 flow [2025-02-06 09:33:13,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=262, PETRI_TRANSITIONS=272} [2025-02-06 09:33:13,661 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -1 predicate places. [2025-02-06 09:33:13,661 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 272 transitions, 754 flow [2025-02-06 09:33:13,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-02-06 09:33:13,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:13,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:13,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:33:13,662 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:13,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1954490551, now seen corresponding path program 1 times [2025-02-06 09:33:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:13,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200232034] [2025-02-06 09:33:13,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:13,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 09:33:13,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 09:33:13,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:13,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:13,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:13,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200232034] [2025-02-06 09:33:13,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200232034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:13,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:13,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376161689] [2025-02-06 09:33:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:13,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:13,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:13,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:13,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 275 [2025-02-06 09:33:13,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 272 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-02-06 09:33:13,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:13,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 275 [2025-02-06 09:33:13,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:13,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L707-10-->L707-7: Formula: (= |v_#race~buffer_size~0_15| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_15|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 293#true, 157#L707-7true, 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 344#true, 339#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, 92#L762-1true, 23#L695-3true]) [2025-02-06 09:33:13,853 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-06 09:33:13,853 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-06 09:33:13,853 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-06 09:33:13,853 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-06 09:33:13,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([696] L695-6-->L695-3: Formula: (= |v_#race~buffer_size~0_18| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_18|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 157#L707-7true, Black: 293#true, 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 339#true, 344#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, 92#L762-1true, 23#L695-3true]) [2025-02-06 09:33:13,880 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-06 09:33:13,881 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-06 09:33:13,881 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-06 09:33:13,881 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-06 09:33:13,881 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([696] L695-6-->L695-3: Formula: (= |v_#race~buffer_size~0_18| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_18|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 293#true, 157#L707-7true, 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 339#true, 344#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, 92#L762-1true, 23#L695-3true]) [2025-02-06 09:33:13,881 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-06 09:33:13,881 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-06 09:33:13,881 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-06 09:33:13,881 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-06 09:33:13,881 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-06 09:33:13,889 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([594] L707-10-->L707-7: Formula: (= |v_#race~buffer_size~0_15| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_15|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 293#true, 157#L707-7true, 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 339#true, 344#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, 92#L762-1true, 23#L695-3true]) [2025-02-06 09:33:13,890 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-06 09:33:13,890 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-06 09:33:13,890 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-06 09:33:13,890 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-06 09:33:13,890 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-06 09:33:14,166 INFO L124 PetriNetUnfolderBase]: 835/6437 cut-off events. [2025-02-06 09:33:14,166 INFO L125 PetriNetUnfolderBase]: For 1027/1063 co-relation queries the response was YES. [2025-02-06 09:33:14,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 6437 events. 835/6437 cut-off events. For 1027/1063 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 64451 event pairs, 194 based on Foata normal form. 6/5832 useless extension candidates. Maximal degree in co-relation 9316. Up to 870 conditions per place. [2025-02-06 09:33:14,208 INFO L140 encePairwiseOnDemand]: 269/275 looper letters, 19 selfloop transitions, 9 changer transitions 0/281 dead transitions. [2025-02-06 09:33:14,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 281 transitions, 841 flow [2025-02-06 09:33:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2025-02-06 09:33:14,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478787878787879 [2025-02-06 09:33:14,210 INFO L175 Difference]: Start difference. First operand has 262 places, 272 transitions, 754 flow. Second operand 3 states and 782 transitions. [2025-02-06 09:33:14,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 281 transitions, 841 flow [2025-02-06 09:33:14,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 281 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:14,219 INFO L231 Difference]: Finished difference. Result has 264 places, 278 transitions, 810 flow [2025-02-06 09:33:14,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=264, PETRI_TRANSITIONS=278} [2025-02-06 09:33:14,224 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 1 predicate places. [2025-02-06 09:33:14,224 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 278 transitions, 810 flow [2025-02-06 09:33:14,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-02-06 09:33:14,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:14,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:14,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:33:14,225 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:14,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:14,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1064700842, now seen corresponding path program 1 times [2025-02-06 09:33:14,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:14,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94770151] [2025-02-06 09:33:14,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:14,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:33:14,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:33:14,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:14,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:14,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:14,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94770151] [2025-02-06 09:33:14,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94770151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:14,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:14,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:14,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410856865] [2025-02-06 09:33:14,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:14,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:14,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:14,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:14,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:14,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 275 [2025-02-06 09:33:14,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 278 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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-02-06 09:33:14,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:14,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 275 [2025-02-06 09:33:14,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:14,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L727-2-->L727-1: Formula: (= |v_#race~send~0_9| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_9|} AuxVars[] AssignedVars[#race~send~0][219], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 293#true, 269#true, 210#L748-1true, 349#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 344#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, 199#L727-1true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), Black: 279#true, 92#L762-1true]) [2025-02-06 09:33:14,639 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-02-06 09:33:14,639 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-06 09:33:14,639 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:33:14,639 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-06 09:33:14,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 344#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), 211#L726true, 25#L750true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), Black: 279#true, 92#L762-1true]) [2025-02-06 09:33:14,748 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-02-06 09:33:14,748 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:33:14,748 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-06 09:33:14,748 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-06 09:33:14,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 259#L764true, 344#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), 25#L750true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), Black: 279#true]) [2025-02-06 09:33:14,782 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-02-06 09:33:14,782 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-06 09:33:14,782 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-06 09:33:14,782 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:33:14,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L731-2-->L731: Formula: (= |v_t1Thread1of1ForFork1_#t~nondet14#1_3| |v_#race~receive~0_6|) InVars {t1Thread1of1ForFork1_#t~nondet14#1=|v_t1Thread1of1ForFork1_#t~nondet14#1_3|} OutVars{t1Thread1of1ForFork1_#t~nondet14#1=|v_t1Thread1of1ForFork1_#t~nondet14#1_3|, #race~receive~0=|v_#race~receive~0_6|} AuxVars[] AssignedVars[#race~receive~0][260], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 269#true, 349#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 344#true, 197#L747-1true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 339#true, 236#L731true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), 92#L762-1true]) [2025-02-06 09:33:14,935 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2025-02-06 09:33:14,935 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-06 09:33:14,935 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-06 09:33:14,935 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-06 09:33:14,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([740] L748-2-->L748: Formula: (= |v_t2Thread1of1ForFork0_#t~nondet20#1_3| |v_#race~send~0_12|) InVars {t2Thread1of1ForFork0_#t~nondet20#1=|v_t2Thread1of1ForFork0_#t~nondet20#1_3|} OutVars{#race~send~0=|v_#race~send~0_12|, t2Thread1of1ForFork0_#t~nondet20#1=|v_t2Thread1of1ForFork0_#t~nondet20#1_3|} AuxVars[] AssignedVars[#race~send~0][251], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 8#L748true, Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 269#true, 349#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 148#L730-1true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, Black: 344#true, 92#L762-1true]) [2025-02-06 09:33:14,942 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2025-02-06 09:33:14,942 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-06 09:33:14,942 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-06 09:33:14,942 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-06 09:33:14,955 INFO L124 PetriNetUnfolderBase]: 1225/8602 cut-off events. [2025-02-06 09:33:14,955 INFO L125 PetriNetUnfolderBase]: For 1486/1546 co-relation queries the response was YES. [2025-02-06 09:33:14,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13466 conditions, 8602 events. 1225/8602 cut-off events. For 1486/1546 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 90373 event pairs, 360 based on Foata normal form. 6/7945 useless extension candidates. Maximal degree in co-relation 13122. Up to 1437 conditions per place. [2025-02-06 09:33:15,005 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 25 selfloop transitions, 5 changer transitions 0/285 dead transitions. [2025-02-06 09:33:15,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 285 transitions, 890 flow [2025-02-06 09:33:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2025-02-06 09:33:15,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9321212121212121 [2025-02-06 09:33:15,007 INFO L175 Difference]: Start difference. First operand has 264 places, 278 transitions, 810 flow. Second operand 3 states and 769 transitions. [2025-02-06 09:33:15,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 285 transitions, 890 flow [2025-02-06 09:33:15,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 285 transitions, 872 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:15,016 INFO L231 Difference]: Finished difference. Result has 266 places, 282 transitions, 834 flow [2025-02-06 09:33:15,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=266, PETRI_TRANSITIONS=282} [2025-02-06 09:33:15,017 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 3 predicate places. [2025-02-06 09:33:15,017 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 282 transitions, 834 flow [2025-02-06 09:33:15,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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-02-06 09:33:15,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:15,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:15,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:33:15,018 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:15,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1590798080, now seen corresponding path program 1 times [2025-02-06 09:33:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478371684] [2025-02-06 09:33:15,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:15,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 09:33:15,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 09:33:15,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:15,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:15,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:15,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478371684] [2025-02-06 09:33:15,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478371684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:15,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:15,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:33:15,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847948624] [2025-02-06 09:33:15,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:15,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:15,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:15,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:15,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:15,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 275 [2025-02-06 09:33:15,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 282 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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-02-06 09:33:15,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:15,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 275 [2025-02-06 09:33:15,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:15,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L707-10-->L707-7: Formula: (= |v_#race~buffer_size~0_15| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_15|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |t1Thread1of1ForFork1_insertLogElement_#t~nondet10#1| |#race~next~0|), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 293#true, 157#L707-7true, 349#true, 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), Black: 279#true, 92#L762-1true, 23#L695-3true]) [2025-02-06 09:33:15,398 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-06 09:33:15,398 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-06 09:33:15,398 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-06 09:33:15,398 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-06 09:33:15,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([696] L695-6-->L695-3: Formula: (= |v_#race~buffer_size~0_18| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_18|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |t1Thread1of1ForFork1_insertLogElement_#t~nondet10#1| |#race~next~0|), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 293#true, 157#L707-7true, 349#true, 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), Black: 279#true, 92#L762-1true, 23#L695-3true]) [2025-02-06 09:33:15,408 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-06 09:33:15,408 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-06 09:33:15,408 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-06 09:33:15,408 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-06 09:33:15,433 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([696] L695-6-->L695-3: Formula: (= |v_#race~buffer_size~0_18| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_18|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |t1Thread1of1ForFork1_insertLogElement_#t~nondet10#1| |#race~next~0|), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 293#true, 157#L707-7true, 349#true, 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), 92#L762-1true, 23#L695-3true]) [2025-02-06 09:33:15,434 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-06 09:33:15,434 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-02-06 09:33:15,434 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-06 09:33:15,434 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-06 09:33:15,434 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-06 09:33:15,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L727-2-->L727-1: Formula: (= |v_#race~send~0_9| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_9|} AuxVars[] AssignedVars[#race~send~0][219], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |t1Thread1of1ForFork1_insertLogElement_#t~nondet10#1| |#race~next~0|), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, 210#L748-1true, 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, 199#L727-1true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), Black: 279#true, 92#L762-1true]) [2025-02-06 09:33:15,604 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-02-06 09:33:15,604 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-06 09:33:15,605 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-06 09:33:15,605 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:33:15,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |t1Thread1of1ForFork1_insertLogElement_#t~nondet10#1| |#race~next~0|), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), 211#L726true, Black: 303#true, 25#L750true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), 92#L762-1true]) [2025-02-06 09:33:15,739 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-02-06 09:33:15,740 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-06 09:33:15,740 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-06 09:33:15,740 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:33:15,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([677] L750-3-->L750: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork0_#t~ret21#1=|v_t2Thread1of1ForFork0_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret21#1][122], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |t1Thread1of1ForFork1_insertLogElement_#t~nondet10#1| |#race~next~0|), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 259#L764true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 25#L750true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|)]) [2025-02-06 09:33:15,791 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-02-06 09:33:15,791 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:33:15,791 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-06 09:33:15,791 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-06 09:33:15,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([740] L748-2-->L748: Formula: (= |v_t2Thread1of1ForFork0_#t~nondet20#1_3| |v_#race~send~0_12|) InVars {t2Thread1of1ForFork0_#t~nondet20#1=|v_t2Thread1of1ForFork0_#t~nondet20#1_3|} OutVars{#race~send~0=|v_#race~send~0_12|, t2Thread1of1ForFork0_#t~nondet20#1=|v_t2Thread1of1ForFork0_#t~nondet20#1_3|} AuxVars[] AssignedVars[#race~send~0][228], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |t1Thread1of1ForFork1_insertLogElement_#t~nondet10#1| |#race~next~0|), 8#L748true, Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, 148#L730-1true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork1_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 279#true, Black: 344#true, 92#L762-1true]) [2025-02-06 09:33:15,843 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-02-06 09:33:15,843 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-06 09:33:15,843 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-06 09:33:15,843 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-06 09:33:15,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L731-2-->L731: Formula: (= |v_t1Thread1of1ForFork1_#t~nondet14#1_3| |v_#race~receive~0_6|) InVars {t1Thread1of1ForFork1_#t~nondet14#1=|v_t1Thread1of1ForFork1_#t~nondet14#1_3|} OutVars{t1Thread1of1ForFork1_#t~nondet14#1=|v_t1Thread1of1ForFork1_#t~nondet14#1_3|, #race~receive~0=|v_#race~receive~0_6|} AuxVars[] AssignedVars[#race~receive~0][244], [Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |t1Thread1of1ForFork1_insertLogElement_#t~nondet10#1| |#race~next~0|), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 305#(= |#race~buffer_size~0| 0), 197#L747-1true, Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 307#true, Black: 339#true, 236#L731true, 354#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), Black: 279#true, 92#L762-1true]) [2025-02-06 09:33:15,946 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-02-06 09:33:15,946 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-06 09:33:15,946 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-06 09:33:15,946 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-06 09:33:16,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L731-2-->L731: Formula: (= |v_t1Thread1of1ForFork1_#t~nondet14#1_3| |v_#race~receive~0_6|) InVars {t1Thread1of1ForFork1_#t~nondet14#1=|v_t1Thread1of1ForFork1_#t~nondet14#1_3|} OutVars{t1Thread1of1ForFork1_#t~nondet14#1=|v_t1Thread1of1ForFork1_#t~nondet14#1_3|, #race~receive~0=|v_#race~receive~0_6|} AuxVars[] AssignedVars[#race~receive~0][244], [Black: 351#(= |t1Thread1of1ForFork1_insertLogElement_#t~nondet10#1| |#race~next~0|), Black: 318#(or (and (<= 2147483648 (mod ~next~0 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1|)) (and (= |t1Thread1of1ForFork1_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork0_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), 269#true, Black: 328#(= |#race~send~0| |t1Thread1of1ForFork1_#t~nondet13#1|), 197#L747-1true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork0_#t~nondet19#1| |#race~receive~0|), Black: 303#true, Black: 339#true, 236#L731true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork1_insertLogElement_#t~short8#1|), Black: 346#(= |#race~send~0| |t2Thread1of1ForFork0_#t~nondet20#1|), 356#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), Black: 279#true, 92#L762-1true]) [2025-02-06 09:33:16,099 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-02-06 09:33:16,099 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-06 09:33:16,099 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-02-06 09:33:16,100 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-02-06 09:33:16,149 INFO L124 PetriNetUnfolderBase]: 1164/10054 cut-off events. [2025-02-06 09:33:16,149 INFO L125 PetriNetUnfolderBase]: For 1892/2017 co-relation queries the response was YES. [2025-02-06 09:33:16,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15364 conditions, 10054 events. 1164/10054 cut-off events. For 1892/2017 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 113105 event pairs, 192 based on Foata normal form. 10/9264 useless extension candidates. Maximal degree in co-relation 15068. Up to 745 conditions per place. [2025-02-06 09:33:16,210 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 19 selfloop transitions, 5 changer transitions 0/290 dead transitions. [2025-02-06 09:33:16,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 290 transitions, 901 flow [2025-02-06 09:33:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2025-02-06 09:33:16,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490909090909091 [2025-02-06 09:33:16,212 INFO L175 Difference]: Start difference. First operand has 266 places, 282 transitions, 834 flow. Second operand 3 states and 783 transitions. [2025-02-06 09:33:16,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 290 transitions, 901 flow [2025-02-06 09:33:16,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 290 transitions, 891 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:33:16,222 INFO L231 Difference]: Finished difference. Result has 268 places, 285 transitions, 860 flow [2025-02-06 09:33:16,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=268, PETRI_TRANSITIONS=285} [2025-02-06 09:33:16,223 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2025-02-06 09:33:16,223 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 285 transitions, 860 flow [2025-02-06 09:33:16,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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-02-06 09:33:16,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:33:16,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:16,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:33:16,224 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-02-06 09:33:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:33:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1043054472, now seen corresponding path program 1 times [2025-02-06 09:33:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:33:16,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020718616] [2025-02-06 09:33:16,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:33:16,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:33:16,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 09:33:16,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 09:33:16,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:33:16,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:33:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:33:16,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:33:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020718616] [2025-02-06 09:33:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020718616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:33:16,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:33:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:33:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905085979] [2025-02-06 09:33:16,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:33:16,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:33:16,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:33:16,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:33:16,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:33:16,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 275 [2025-02-06 09:33:16,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 285 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-02-06 09:33:16,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:33:16,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 275 [2025-02-06 09:33:16,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:33:16,499 INFO L124 PetriNetUnfolderBase]: 151/1883 cut-off events. [2025-02-06 09:33:16,499 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2025-02-06 09:33:16,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1883 events. 151/1883 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13753 event pairs, 17 based on Foata normal form. 40/1816 useless extension candidates. Maximal degree in co-relation 2100. Up to 98 conditions per place. [2025-02-06 09:33:16,505 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 0 selfloop transitions, 0 changer transitions 244/244 dead transitions. [2025-02-06 09:33:16,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 244 transitions, 669 flow [2025-02-06 09:33:16,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:33:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:33:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2025-02-06 09:33:16,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575757575757575 [2025-02-06 09:33:16,507 INFO L175 Difference]: Start difference. First operand has 268 places, 285 transitions, 860 flow. Second operand 3 states and 790 transitions. [2025-02-06 09:33:16,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 244 transitions, 669 flow [2025-02-06 09:33:16,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 244 transitions, 585 flow, removed 21 selfloop flow, removed 16 redundant places. [2025-02-06 09:33:16,512 INFO L231 Difference]: Finished difference. Result has 244 places, 0 transitions, 0 flow [2025-02-06 09:33:16,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=244, PETRI_TRANSITIONS=0} [2025-02-06 09:33:16,512 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -19 predicate places. [2025-02-06 09:33:16,512 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 0 transitions, 0 flow [2025-02-06 09:33:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-02-06 09:33:16,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2025-02-06 09:33:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2025-02-06 09:33:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2025-02-06 09:33:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2025-02-06 09:33:16,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2025-02-06 09:33:16,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2025-02-06 09:33:16,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2025-02-06 09:33:16,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2025-02-06 09:33:16,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2025-02-06 09:33:16,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2025-02-06 09:33:16,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2025-02-06 09:33:16,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:33:16,518 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:33:16,523 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:33:16,523 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:33:16,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:33:16 BasicIcfg [2025-02-06 09:33:16,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:33:16,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:33:16,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:33:16,530 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:33:16,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:33:06" (3/4) ... [2025-02-06 09:33:16,531 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:33:16,533 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-06 09:33:16,534 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-06 09:33:16,537 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 09:33:16,537 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:33:16,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:33:16,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:33:16,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:33:16,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:33:16,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:33:16,598 INFO L158 Benchmark]: Toolchain (without parser) took 11105.59ms. Allocated memory was 142.6MB in the beginning and 956.3MB in the end (delta: 813.7MB). Free memory was 107.1MB in the beginning and 611.0MB in the end (delta: -503.9MB). Peak memory consumption was 311.9MB. Max. memory is 16.1GB. [2025-02-06 09:33:16,598 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 218.1MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:33:16,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.27ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 85.7MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:33:16,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.72ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:33:16,600 INFO L158 Benchmark]: Boogie Preprocessor took 23.61ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:33:16,601 INFO L158 Benchmark]: IcfgBuilder took 493.16ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 57.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:33:16,601 INFO L158 Benchmark]: TraceAbstraction took 10120.83ms. Allocated memory was 142.6MB in the beginning and 956.3MB in the end (delta: 813.7MB). Free memory was 57.2MB in the beginning and 615.3MB in the end (delta: -558.1MB). Peak memory consumption was 261.6MB. Max. memory is 16.1GB. [2025-02-06 09:33:16,601 INFO L158 Benchmark]: Witness Printer took 67.76ms. Allocated memory is still 956.3MB. Free memory was 615.3MB in the beginning and 611.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:33:16,602 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.20ms. Allocated memory is still 218.1MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.27ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 85.7MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.72ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.61ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 493.16ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 57.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10120.83ms. Allocated memory was 142.6MB in the beginning and 956.3MB in the end (delta: 813.7MB). Free memory was 57.2MB in the beginning and 615.3MB in the end (delta: -558.1MB). Peak memory consumption was 261.6MB. Max. memory is 16.1GB. * Witness Printer took 67.76ms. Allocated memory is still 956.3MB. Free memory was 615.3MB in the beginning and 611.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 690]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 730]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 731]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 747]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 748]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 54 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: 10.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 172 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=20, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1915 NumberOfCodeBlocks, 1915 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:33:16,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE