./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc1a8bd7c922f93873ec39bdce92396c491017d4a5984ae9a59a0e03f4bb08ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:56:24,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:56:24,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:56:24,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:56:24,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:56:24,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:56:24,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:56:24,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:56:24,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:56:24,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:56:24,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:56:24,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:56:24,507 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:56:24,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:56:24,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:56:24,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:56:24,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:56:24,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:56:24,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:56:24,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:56:24,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:56:24,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:56:24,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:56:24,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:56:24,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:56:24,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:56:24,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:56:24,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:56:24,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:56:24,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:56:24,510 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc1a8bd7c922f93873ec39bdce92396c491017d4a5984ae9a59a0e03f4bb08ec [2025-03-08 21:56:24,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:56:24,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:56:24,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:56:24,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:56:24,759 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:56:24,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i [2025-03-08 21:56:25,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f2e0b04/7db971434fcc4225b28105c3c5b2ab56/FLAG94a1ad8b5 [2025-03-08 21:56:26,231 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:56:26,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-2.i [2025-03-08 21:56:26,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f2e0b04/7db971434fcc4225b28105c3c5b2ab56/FLAG94a1ad8b5 [2025-03-08 21:56:26,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f2e0b04/7db971434fcc4225b28105c3c5b2ab56 [2025-03-08 21:56:26,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:56:26,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:56:26,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:56:26,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:56:26,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:56:26,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577f00f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26, skipping insertion in model container [2025-03-08 21:56:26,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:56:26,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:56:26,773 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:56:26,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:56:26,822 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:56:26,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26 WrapperNode [2025-03-08 21:56:26,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:56:26,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:56:26,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:56:26,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:56:26,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,856 INFO L138 Inliner]: procedures = 171, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 107 [2025-03-08 21:56:26,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:56:26,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:56:26,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:56:26,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:56:26,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:56:26,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:56:26,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:56:26,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:56:26,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (1/1) ... [2025-03-08 21:56:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:56:26,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:56:26,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:56:26,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:56:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-08 21:56:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-08 21:56:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-08 21:56:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-08 21:56:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:56:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:56:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:56:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:56:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:56:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:56:26,925 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:56:27,013 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:56:27,014 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:56:27,163 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:56:27,163 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:56:27,179 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:56:27,179 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:56:27,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:27 BoogieIcfgContainer [2025-03-08 21:56:27,181 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:56:27,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:56:27,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:56:27,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:56:27,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:56:26" (1/3) ... [2025-03-08 21:56:27,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff5e2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:27, skipping insertion in model container [2025-03-08 21:56:27,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:26" (2/3) ... [2025-03-08 21:56:27,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff5e2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:27, skipping insertion in model container [2025-03-08 21:56:27,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:27" (3/3) ... [2025-03-08 21:56:27,189 INFO L128 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-2.i [2025-03-08 21:56:27,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:56:27,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nondet-loop-bound-variant-2.i that has 3 procedures, 131 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-08 21:56:27,200 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:56:27,260 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:56:27,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 138 transitions, 284 flow [2025-03-08 21:56:27,341 INFO L124 PetriNetUnfolderBase]: 8/152 cut-off events. [2025-03-08 21:56:27,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:56:27,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 152 events. 8/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 99. Up to 4 conditions per place. [2025-03-08 21:56:27,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 138 transitions, 284 flow [2025-03-08 21:56:27,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 281 flow [2025-03-08 21:56:27,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:56:27,364 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;@1d827a39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:56:27,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-08 21:56:27,370 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:56:27,370 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-08 21:56:27,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:56:27,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:27,371 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] [2025-03-08 21:56:27,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 21:56:27,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash -197092629, now seen corresponding path program 1 times [2025-03-08 21:56:27,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:27,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550369157] [2025-03-08 21:56:27,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:27,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 21:56:27,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 21:56:27,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:27,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550369157] [2025-03-08 21:56:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550369157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:27,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:27,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155735516] [2025-03-08 21:56:27,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:27,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:27,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:27,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:27,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2025-03-08 21:56:27,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 137 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:27,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:27,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2025-03-08 21:56:27,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:27,740 INFO L124 PetriNetUnfolderBase]: 23/314 cut-off events. [2025-03-08 21:56:27,740 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:56:27,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 314 events. 23/314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1263 event pairs, 19 based on Foata normal form. 38/300 useless extension candidates. Maximal degree in co-relation 304. Up to 47 conditions per place. [2025-03-08 21:56:27,744 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 11 selfloop transitions, 2 changer transitions 1/129 dead transitions. [2025-03-08 21:56:27,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 291 flow [2025-03-08 21:56:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-03-08 21:56:27,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2025-03-08 21:56:27,755 INFO L175 Difference]: Start difference. First operand has 136 places, 137 transitions, 281 flow. Second operand 3 states and 373 transitions. [2025-03-08 21:56:27,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 291 flow [2025-03-08 21:56:27,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:27,762 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 266 flow [2025-03-08 21:56:27,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2025-03-08 21:56:27,769 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-03-08 21:56:27,770 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 266 flow [2025-03-08 21:56:27,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:27,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:27,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:27,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:56:27,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 21:56:27,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash 113172054, now seen corresponding path program 1 times [2025-03-08 21:56:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:27,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79254209] [2025-03-08 21:56:27,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:27,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:56:27,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:56:27,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:27,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:27,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:27,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79254209] [2025-03-08 21:56:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79254209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858313698] [2025-03-08 21:56:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:27,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:27,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:27,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:27,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2025-03-08 21:56:27,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:27,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:27,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2025-03-08 21:56:27,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:27,942 INFO L124 PetriNetUnfolderBase]: 28/394 cut-off events. [2025-03-08 21:56:27,943 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:56:27,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 394 events. 28/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1720 event pairs, 26 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 436. Up to 62 conditions per place. [2025-03-08 21:56:27,947 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 13 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2025-03-08 21:56:27,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 294 flow [2025-03-08 21:56:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-03-08 21:56:27,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8792270531400966 [2025-03-08 21:56:27,951 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 266 flow. Second operand 3 states and 364 transitions. [2025-03-08 21:56:27,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 294 flow [2025-03-08 21:56:27,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 127 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:27,954 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 264 flow [2025-03-08 21:56:27,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2025-03-08 21:56:27,955 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -4 predicate places. [2025-03-08 21:56:27,955 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 264 flow [2025-03-08 21:56:27,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:27,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:27,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:27,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:56:27,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 21:56:27,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1253749340, now seen corresponding path program 1 times [2025-03-08 21:56:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396572041] [2025-03-08 21:56:27,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:27,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:56:27,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:56:27,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:27,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:28,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:28,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396572041] [2025-03-08 21:56:28,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396572041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:28,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:28,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:28,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841194376] [2025-03-08 21:56:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:28,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:28,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:28,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:28,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2025-03-08 21:56:28,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:28,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:28,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2025-03-08 21:56:28,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:28,127 INFO L124 PetriNetUnfolderBase]: 68/518 cut-off events. [2025-03-08 21:56:28,127 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:56:28,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 518 events. 68/518 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2764 event pairs, 58 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 609. Up to 116 conditions per place. [2025-03-08 21:56:28,132 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2025-03-08 21:56:28,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 284 flow [2025-03-08 21:56:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-08 21:56:28,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8599033816425121 [2025-03-08 21:56:28,134 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 264 flow. Second operand 3 states and 356 transitions. [2025-03-08 21:56:28,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 284 flow [2025-03-08 21:56:28,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:28,138 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 252 flow [2025-03-08 21:56:28,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2025-03-08 21:56:28,139 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2025-03-08 21:56:28,140 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 252 flow [2025-03-08 21:56:28,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:28,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:28,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:28,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:56:28,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 21:56:28,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash 829361222, now seen corresponding path program 1 times [2025-03-08 21:56:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:28,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711477413] [2025-03-08 21:56:28,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:28,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 21:56:28,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 21:56:28,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:28,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:28,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:28,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711477413] [2025-03-08 21:56:28,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711477413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:28,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:28,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:28,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623343916] [2025-03-08 21:56:28,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:28,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:28,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:28,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:28,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:28,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138 [2025-03-08 21:56:28,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:28,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:28,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138 [2025-03-08 21:56:28,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:28,267 INFO L124 PetriNetUnfolderBase]: 17/278 cut-off events. [2025-03-08 21:56:28,268 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:56:28,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 278 events. 17/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 880 event pairs, 6 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 296. Up to 32 conditions per place. [2025-03-08 21:56:28,269 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2025-03-08 21:56:28,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 299 flow [2025-03-08 21:56:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2025-03-08 21:56:28,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2025-03-08 21:56:28,270 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 252 flow. Second operand 3 states and 379 transitions. [2025-03-08 21:56:28,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 299 flow [2025-03-08 21:56:28,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:28,273 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 279 flow [2025-03-08 21:56:28,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=129, PETRI_TRANSITIONS=124} [2025-03-08 21:56:28,274 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -7 predicate places. [2025-03-08 21:56:28,274 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 279 flow [2025-03-08 21:56:28,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:28,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:28,274 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:28,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:56:28,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 21:56:28,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:28,275 INFO L85 PathProgramCache]: Analyzing trace with hash -520679462, now seen corresponding path program 1 times [2025-03-08 21:56:28,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:28,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207924659] [2025-03-08 21:56:28,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:28,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:28,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:56:28,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:56:28,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:28,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:28,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:28,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207924659] [2025-03-08 21:56:28,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207924659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:28,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:28,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:56:28,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687142447] [2025-03-08 21:56:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:28,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:56:28,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:28,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:56:28,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:56:28,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2025-03-08 21:56:28,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 124 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:28,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:28,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2025-03-08 21:56:28,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:28,520 INFO L124 PetriNetUnfolderBase]: 12/280 cut-off events. [2025-03-08 21:56:28,520 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 21:56:28,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 280 events. 12/280 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 923 event pairs, 8 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 325. Up to 34 conditions per place. [2025-03-08 21:56:28,522 INFO L140 encePairwiseOnDemand]: 134/138 looper letters, 16 selfloop transitions, 0 changer transitions 4/127 dead transitions. [2025-03-08 21:56:28,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 127 transitions, 325 flow [2025-03-08 21:56:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:56:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 21:56:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2025-03-08 21:56:28,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8565217391304348 [2025-03-08 21:56:28,524 INFO L175 Difference]: Start difference. First operand has 129 places, 124 transitions, 279 flow. Second operand 5 states and 591 transitions. [2025-03-08 21:56:28,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 127 transitions, 325 flow [2025-03-08 21:56:28,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 127 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:28,527 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 275 flow [2025-03-08 21:56:28,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2025-03-08 21:56:28,529 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-03-08 21:56:28,530 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 275 flow [2025-03-08 21:56:28,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:28,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:28,530 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:28,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:56:28,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 21:56:28,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1656883309, now seen corresponding path program 1 times [2025-03-08 21:56:28,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:28,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836684533] [2025-03-08 21:56:28,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:28,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 21:56:28,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 21:56:28,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:28,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:28,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:56:28,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 21:56:28,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 21:56:28,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:28,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:28,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:56:28,583 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:56:28,584 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-08 21:56:28,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-03-08 21:56:28,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-03-08 21:56:28,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-03-08 21:56:28,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-03-08 21:56:28,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-03-08 21:56:28,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:56:28,587 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 21:56:28,589 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:56:28,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 21:56:28,615 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:56:28,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 194 transitions, 408 flow [2025-03-08 21:56:28,650 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2025-03-08 21:56:28,651 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:56:28,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 11/206 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 373 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 213. Up to 6 conditions per place. [2025-03-08 21:56:28,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 194 transitions, 408 flow [2025-03-08 21:56:28,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 171 transitions, 355 flow [2025-03-08 21:56:28,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:56:28,653 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;@1d827a39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:56:28,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-08 21:56:28,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:56:28,655 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-08 21:56:28,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:56:28,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:28,655 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] [2025-03-08 21:56:28,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:56:28,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:28,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2000815955, now seen corresponding path program 1 times [2025-03-08 21:56:28,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:28,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671021081] [2025-03-08 21:56:28,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:28,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:28,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 21:56:28,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 21:56:28,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:28,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:28,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671021081] [2025-03-08 21:56:28,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671021081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:28,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:28,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:28,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511511502] [2025-03-08 21:56:28,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:28,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:28,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:28,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:28,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:28,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2025-03-08 21:56:28,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 171 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:28,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:28,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2025-03-08 21:56:28,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:28,798 INFO L124 PetriNetUnfolderBase]: 216/1072 cut-off events. [2025-03-08 21:56:28,799 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-08 21:56:28,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1072 events. 216/1072 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7297 event pairs, 189 based on Foata normal form. 226/1128 useless extension candidates. Maximal degree in co-relation 1362. Up to 317 conditions per place. [2025-03-08 21:56:28,807 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 16 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2025-03-08 21:56:28,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 373 flow [2025-03-08 21:56:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-03-08 21:56:28,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8831615120274914 [2025-03-08 21:56:28,809 INFO L175 Difference]: Start difference. First operand has 170 places, 171 transitions, 355 flow. Second operand 3 states and 514 transitions. [2025-03-08 21:56:28,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 373 flow [2025-03-08 21:56:28,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:28,811 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 338 flow [2025-03-08 21:56:28,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2025-03-08 21:56:28,812 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -2 predicate places. [2025-03-08 21:56:28,812 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 338 flow [2025-03-08 21:56:28,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:28,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:28,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:28,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:56:28,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:56:28,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1718584488, now seen corresponding path program 1 times [2025-03-08 21:56:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:28,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198213830] [2025-03-08 21:56:28,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:28,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:28,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:56:28,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:56:28,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:28,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:28,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:28,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198213830] [2025-03-08 21:56:28,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198213830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:28,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:28,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824289736] [2025-03-08 21:56:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:28,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:28,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:28,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:28,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2025-03-08 21:56:28,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:28,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:28,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2025-03-08 21:56:28,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:29,028 INFO L124 PetriNetUnfolderBase]: 205/1268 cut-off events. [2025-03-08 21:56:29,030 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-08 21:56:29,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 1268 events. 205/1268 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8944 event pairs, 194 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 1598. Up to 326 conditions per place. [2025-03-08 21:56:29,041 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 17 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2025-03-08 21:56:29,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 160 transitions, 374 flow [2025-03-08 21:56:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-03-08 21:56:29,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8694158075601375 [2025-03-08 21:56:29,043 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 338 flow. Second operand 3 states and 506 transitions. [2025-03-08 21:56:29,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 160 transitions, 374 flow [2025-03-08 21:56:29,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:29,046 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 336 flow [2025-03-08 21:56:29,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2025-03-08 21:56:29,047 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -4 predicate places. [2025-03-08 21:56:29,047 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 336 flow [2025-03-08 21:56:29,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:29,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:29,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:29,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:56:29,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:56:29,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash 477608486, now seen corresponding path program 1 times [2025-03-08 21:56:29,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:29,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125340565] [2025-03-08 21:56:29,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:29,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:29,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:56:29,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:56:29,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:29,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:29,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:29,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125340565] [2025-03-08 21:56:29,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125340565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:29,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:29,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:29,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595141909] [2025-03-08 21:56:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:29,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:29,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:29,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:29,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 194 [2025-03-08 21:56:29,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:29,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:29,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 194 [2025-03-08 21:56:29,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:29,315 INFO L124 PetriNetUnfolderBase]: 590/2395 cut-off events. [2025-03-08 21:56:29,315 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-08 21:56:29,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 2395 events. 590/2395 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 19534 event pairs, 508 based on Foata normal form. 0/2106 useless extension candidates. Maximal degree in co-relation 3206. Up to 791 conditions per place. [2025-03-08 21:56:29,386 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 19 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2025-03-08 21:56:29,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 364 flow [2025-03-08 21:56:29,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-03-08 21:56:29,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384879725085911 [2025-03-08 21:56:29,388 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 336 flow. Second operand 3 states and 488 transitions. [2025-03-08 21:56:29,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 364 flow [2025-03-08 21:56:29,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 154 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:29,390 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 322 flow [2025-03-08 21:56:29,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2025-03-08 21:56:29,391 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -10 predicate places. [2025-03-08 21:56:29,391 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 322 flow [2025-03-08 21:56:29,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:29,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:29,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:29,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:56:29,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:56:29,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash -780626872, now seen corresponding path program 1 times [2025-03-08 21:56:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753079138] [2025-03-08 21:56:29,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:29,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 21:56:29,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 21:56:29,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:29,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:29,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:29,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753079138] [2025-03-08 21:56:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753079138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355439718] [2025-03-08 21:56:29,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:29,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:29,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:29,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:29,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:29,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 194 [2025-03-08 21:56:29,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:29,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:29,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 194 [2025-03-08 21:56:29,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:29,585 INFO L124 PetriNetUnfolderBase]: 347/1375 cut-off events. [2025-03-08 21:56:29,585 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-08 21:56:29,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1375 events. 347/1375 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9696 event pairs, 117 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 2016. Up to 382 conditions per place. [2025-03-08 21:56:29,593 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 25 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2025-03-08 21:56:29,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 424 flow [2025-03-08 21:56:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-03-08 21:56:29,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8917525773195877 [2025-03-08 21:56:29,594 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 322 flow. Second operand 3 states and 519 transitions. [2025-03-08 21:56:29,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 424 flow [2025-03-08 21:56:29,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 168 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:29,597 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 391 flow [2025-03-08 21:56:29,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=163, PETRI_TRANSITIONS=162} [2025-03-08 21:56:29,599 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -7 predicate places. [2025-03-08 21:56:29,599 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 391 flow [2025-03-08 21:56:29,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:29,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:29,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:29,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:56:29,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:56:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 162569169, now seen corresponding path program 1 times [2025-03-08 21:56:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267689779] [2025-03-08 21:56:29,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:29,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 21:56:29,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 21:56:29,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:29,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:29,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:29,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267689779] [2025-03-08 21:56:29,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267689779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:29,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:29,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157230414] [2025-03-08 21:56:29,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:29,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:29,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:29,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:29,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:29,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2025-03-08 21:56:29,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:29,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:29,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2025-03-08 21:56:29,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:29,843 INFO L124 PetriNetUnfolderBase]: 447/1925 cut-off events. [2025-03-08 21:56:29,843 INFO L125 PetriNetUnfolderBase]: For 612/632 co-relation queries the response was YES. [2025-03-08 21:56:29,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 1925 events. 447/1925 cut-off events. For 612/632 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15514 event pairs, 158 based on Foata normal form. 2/1715 useless extension candidates. Maximal degree in co-relation 3321. Up to 585 conditions per place. [2025-03-08 21:56:29,858 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 23 selfloop transitions, 10 changer transitions 0/173 dead transitions. [2025-03-08 21:56:29,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 502 flow [2025-03-08 21:56:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2025-03-08 21:56:29,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951890034364262 [2025-03-08 21:56:29,861 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 391 flow. Second operand 3 states and 521 transitions. [2025-03-08 21:56:29,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 502 flow [2025-03-08 21:56:29,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 173 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:29,866 INFO L231 Difference]: Finished difference. Result has 165 places, 170 transitions, 461 flow [2025-03-08 21:56:29,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=165, PETRI_TRANSITIONS=170} [2025-03-08 21:56:29,867 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -5 predicate places. [2025-03-08 21:56:29,868 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 461 flow [2025-03-08 21:56:29,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:29,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:29,868 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:29,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:56:29,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:56:29,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1791971901, now seen corresponding path program 1 times [2025-03-08 21:56:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942896947] [2025-03-08 21:56:29,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:29,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 21:56:29,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 21:56:29,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:29,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942896947] [2025-03-08 21:56:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942896947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:29,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:29,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:56:29,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657736280] [2025-03-08 21:56:29,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:29,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:56:29,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:29,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:56:29,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:56:29,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2025-03-08 21:56:29,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 170 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:29,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:29,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2025-03-08 21:56:29,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:30,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([500] L705-3-->L705: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread2of2ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of2ForFork1_#t~ret6#1=|v_thr2Thread2of2ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of2ForFork1_#t~ret6#1][153], [120#L705true, Black: 205#true, 113#thr1ENTRYtrue, 194#true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 39#L705true, 28#L714-1true, 210#true, 192#true, 215#true, 204#(= |#race~n~0| 0), 188#true]) [2025-03-08 21:56:30,142 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-03-08 21:56:30,143 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-08 21:56:30,143 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-03-08 21:56:30,143 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-03-08 21:56:30,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([533] L705-3-->L705: Formula: (and (= |v_thr2Thread1of2ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of2ForFork1_#t~ret6#1=|v_thr2Thread1of2ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of2ForFork1_#t~ret6#1][125], [120#L705true, Black: 205#true, 113#thr1ENTRYtrue, 194#true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 39#L705true, 210#true, 192#true, 215#true, 54#L-1true, 204#(= |#race~n~0| 0), 188#true]) [2025-03-08 21:56:30,244 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-03-08 21:56:30,244 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-08 21:56:30,244 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-08 21:56:30,244 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-08 21:56:30,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([533] L705-3-->L705: Formula: (and (= |v_thr2Thread1of2ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of2ForFork1_#t~ret6#1=|v_thr2Thread1of2ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of2ForFork1_#t~ret6#1][125], [120#L705true, 113#thr1ENTRYtrue, Black: 207#(= |#race~x~0| 0), 194#true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 39#L705true, 210#true, 192#true, 215#true, 54#L-1true, 204#(= |#race~n~0| 0), 188#true]) [2025-03-08 21:56:30,270 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2025-03-08 21:56:30,271 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-08 21:56:30,271 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-08 21:56:30,271 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-08 21:56:30,277 INFO L124 PetriNetUnfolderBase]: 539/2952 cut-off events. [2025-03-08 21:56:30,278 INFO L125 PetriNetUnfolderBase]: For 551/794 co-relation queries the response was YES. [2025-03-08 21:56:30,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 2952 events. 539/2952 cut-off events. For 551/794 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 27765 event pairs, 215 based on Foata normal form. 1/2595 useless extension candidates. Maximal degree in co-relation 4695. Up to 443 conditions per place. [2025-03-08 21:56:30,303 INFO L140 encePairwiseOnDemand]: 190/194 looper letters, 19 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2025-03-08 21:56:30,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 513 flow [2025-03-08 21:56:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:56:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 21:56:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2025-03-08 21:56:30,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8597938144329897 [2025-03-08 21:56:30,306 INFO L175 Difference]: Start difference. First operand has 165 places, 170 transitions, 461 flow. Second operand 5 states and 834 transitions. [2025-03-08 21:56:30,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 513 flow [2025-03-08 21:56:30,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 173 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:30,311 INFO L231 Difference]: Finished difference. Result has 170 places, 169 transitions, 445 flow [2025-03-08 21:56:30,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=170, PETRI_TRANSITIONS=169} [2025-03-08 21:56:30,312 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 0 predicate places. [2025-03-08 21:56:30,312 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 445 flow [2025-03-08 21:56:30,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:30,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:30,313 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:30,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:56:30,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:56:30,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1936700418, now seen corresponding path program 1 times [2025-03-08 21:56:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:30,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873297231] [2025-03-08 21:56:30,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:30,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 21:56:30,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 21:56:30,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:30,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:30,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:56:30,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 21:56:30,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 21:56:30,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:30,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:30,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:56:30,349 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:56:30,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-08 21:56:30,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-08 21:56:30,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-08 21:56:30,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-08 21:56:30,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-08 21:56:30,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-08 21:56:30,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-08 21:56:30,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-08 21:56:30,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-08 21:56:30,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-08 21:56:30,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-08 21:56:30,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-08 21:56:30,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-08 21:56:30,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:56:30,351 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:30,352 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:56:30,352 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 21:56:30,392 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:56:30,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 250 transitions, 536 flow [2025-03-08 21:56:30,418 INFO L124 PetriNetUnfolderBase]: 14/260 cut-off events. [2025-03-08 21:56:30,418 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 21:56:30,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 260 events. 14/260 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 554 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 271. Up to 8 conditions per place. [2025-03-08 21:56:30,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 250 transitions, 536 flow [2025-03-08 21:56:30,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 205 transitions, 431 flow [2025-03-08 21:56:30,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:56:30,423 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;@1d827a39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:56:30,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-08 21:56:30,425 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:56:30,425 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-08 21:56:30,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:56:30,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:30,425 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] [2025-03-08 21:56:30,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:56:30,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1120993959, now seen corresponding path program 1 times [2025-03-08 21:56:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728884609] [2025-03-08 21:56:30,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:30,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 21:56:30,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 21:56:30,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:30,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:30,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:30,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728884609] [2025-03-08 21:56:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728884609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:30,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:30,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132657785] [2025-03-08 21:56:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:30,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:30,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:30,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:30,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2025-03-08 21:56:30,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 205 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:30,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:30,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2025-03-08 21:56:30,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:30,949 INFO L124 PetriNetUnfolderBase]: 1589/4910 cut-off events. [2025-03-08 21:56:30,949 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-03-08 21:56:30,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7220 conditions, 4910 events. 1589/4910 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 44652 event pairs, 1439 based on Foata normal form. 1274/5496 useless extension candidates. Maximal degree in co-relation 7150. Up to 2067 conditions per place. [2025-03-08 21:56:30,984 INFO L140 encePairwiseOnDemand]: 240/250 looper letters, 21 selfloop transitions, 2 changer transitions 1/195 dead transitions. [2025-03-08 21:56:30,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 195 transitions, 457 flow [2025-03-08 21:56:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2025-03-08 21:56:30,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2025-03-08 21:56:30,986 INFO L175 Difference]: Start difference. First operand has 204 places, 205 transitions, 431 flow. Second operand 3 states and 655 transitions. [2025-03-08 21:56:30,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 195 transitions, 457 flow [2025-03-08 21:56:30,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 195 transitions, 454 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:30,989 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2025-03-08 21:56:30,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2025-03-08 21:56:30,989 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -2 predicate places. [2025-03-08 21:56:30,990 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2025-03-08 21:56:30,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:30,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:30,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:30,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:56:30,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:56:30,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1289580654, now seen corresponding path program 1 times [2025-03-08 21:56:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:30,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998520903] [2025-03-08 21:56:30,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:30,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:56:30,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:56:30,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:30,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:31,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:31,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998520903] [2025-03-08 21:56:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998520903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:31,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732590369] [2025-03-08 21:56:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:31,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:31,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:31,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:31,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:31,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2025-03-08 21:56:31,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:31,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:31,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2025-03-08 21:56:31,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:31,740 INFO L124 PetriNetUnfolderBase]: 1176/6582 cut-off events. [2025-03-08 21:56:31,740 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2025-03-08 21:56:31,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8387 conditions, 6582 events. 1176/6582 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 70652 event pairs, 1154 based on Foata normal form. 0/5582 useless extension candidates. Maximal degree in co-relation 8352. Up to 1670 conditions per place. [2025-03-08 21:56:31,787 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 21 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-03-08 21:56:31,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 193 transitions, 454 flow [2025-03-08 21:56:31,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-03-08 21:56:31,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.864 [2025-03-08 21:56:31,789 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 648 transitions. [2025-03-08 21:56:31,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 193 transitions, 454 flow [2025-03-08 21:56:31,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 193 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:31,793 INFO L231 Difference]: Finished difference. Result has 200 places, 193 transitions, 408 flow [2025-03-08 21:56:31,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=200, PETRI_TRANSITIONS=193} [2025-03-08 21:56:31,793 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -4 predicate places. [2025-03-08 21:56:31,793 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 193 transitions, 408 flow [2025-03-08 21:56:31,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:31,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:31,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:31,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:56:31,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:56:31,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:31,795 INFO L85 PathProgramCache]: Analyzing trace with hash 981897184, now seen corresponding path program 1 times [2025-03-08 21:56:31,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:31,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828405759] [2025-03-08 21:56:31,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:31,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:56:31,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:56:31,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:31,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:31,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828405759] [2025-03-08 21:56:31,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828405759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:31,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:31,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619393045] [2025-03-08 21:56:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:31,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:31,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:31,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 250 [2025-03-08 21:56:31,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 193 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:31,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:31,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 250 [2025-03-08 21:56:31,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:32,980 INFO L124 PetriNetUnfolderBase]: 4181/13046 cut-off events. [2025-03-08 21:56:32,981 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2025-03-08 21:56:33,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18399 conditions, 13046 events. 4181/13046 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 140816 event pairs, 3658 based on Foata normal form. 0/11319 useless extension candidates. Maximal degree in co-relation 18357. Up to 5066 conditions per place. [2025-03-08 21:56:33,064 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 24 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2025-03-08 21:56:33,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 444 flow [2025-03-08 21:56:33,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2025-03-08 21:56:33,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2025-03-08 21:56:33,067 INFO L175 Difference]: Start difference. First operand has 200 places, 193 transitions, 408 flow. Second operand 3 states and 620 transitions. [2025-03-08 21:56:33,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 444 flow [2025-03-08 21:56:33,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:33,069 INFO L231 Difference]: Finished difference. Result has 193 places, 186 transitions, 392 flow [2025-03-08 21:56:33,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=193, PETRI_TRANSITIONS=186} [2025-03-08 21:56:33,070 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -11 predicate places. [2025-03-08 21:56:33,070 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 186 transitions, 392 flow [2025-03-08 21:56:33,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:33,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:33,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:33,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:56:33,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:56:33,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1527514099, now seen corresponding path program 1 times [2025-03-08 21:56:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:33,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620420805] [2025-03-08 21:56:33,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:33,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:33,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 21:56:33,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 21:56:33,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:33,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:33,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:33,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620420805] [2025-03-08 21:56:33,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620420805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:33,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:33,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:33,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313231418] [2025-03-08 21:56:33,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:33,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:33,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:33,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:33,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:33,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 250 [2025-03-08 21:56:33,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 186 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:33,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:33,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 250 [2025-03-08 21:56:33,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:34,395 INFO L124 PetriNetUnfolderBase]: 4747/12923 cut-off events. [2025-03-08 21:56:34,395 INFO L125 PetriNetUnfolderBase]: For 840/840 co-relation queries the response was YES. [2025-03-08 21:56:34,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20480 conditions, 12923 events. 4747/12923 cut-off events. For 840/840 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 135244 event pairs, 1658 based on Foata normal form. 0/11283 useless extension candidates. Maximal degree in co-relation 20438. Up to 4100 conditions per place. [2025-03-08 21:56:34,520 INFO L140 encePairwiseOnDemand]: 235/250 looper letters, 35 selfloop transitions, 11 changer transitions 0/206 dead transitions. [2025-03-08 21:56:34,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 206 transitions, 537 flow [2025-03-08 21:56:34,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-03-08 21:56:34,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746666666666667 [2025-03-08 21:56:34,523 INFO L175 Difference]: Start difference. First operand has 193 places, 186 transitions, 392 flow. Second operand 3 states and 656 transitions. [2025-03-08 21:56:34,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 206 transitions, 537 flow [2025-03-08 21:56:34,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 206 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:34,526 INFO L231 Difference]: Finished difference. Result has 196 places, 197 transitions, 487 flow [2025-03-08 21:56:34,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=196, PETRI_TRANSITIONS=197} [2025-03-08 21:56:34,527 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -8 predicate places. [2025-03-08 21:56:34,527 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 197 transitions, 487 flow [2025-03-08 21:56:34,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:34,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:34,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:34,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:56:34,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:56:34,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:34,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1960242051, now seen corresponding path program 1 times [2025-03-08 21:56:34,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:34,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064352049] [2025-03-08 21:56:34,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:34,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 21:56:34,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 21:56:34,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:34,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:34,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:34,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064352049] [2025-03-08 21:56:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064352049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:34,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:34,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:56:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945097006] [2025-03-08 21:56:34,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:56:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:34,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:56:34,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:56:34,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2025-03-08 21:56:34,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 197 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:34,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:34,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2025-03-08 21:56:34,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:35,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][121], [139#L714-1true, 240#true, 29#L700true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, 263#(= |#race~x~0| 0), 95#L705true, 260#(= |#race~n~0| 0), 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:35,667 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2025-03-08 21:56:35,667 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:56:35,667 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-08 21:56:35,667 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-08 21:56:35,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [120#L694-5true, 139#L714-1true, 240#true, 29#L700true, Black: 261#true, 266#true, 246#true, 263#(= |#race~x~0| 0), 95#L705true, 260#(= |#race~n~0| 0), 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:35,678 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-08 21:56:35,678 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-08 21:56:35,678 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-08 21:56:35,678 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-08 21:56:35,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][213], [139#L714-1true, 33#L694-4true, 240#true, 29#L700true, Black: 261#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 13#L705true, 232#L703-1true]) [2025-03-08 21:56:35,803 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-08 21:56:35,803 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:56:35,803 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:56:35,803 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:56:36,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][202], [120#L694-5true, 139#L714-1true, 240#true, Black: 261#true, 215#L705true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 13#L705true, 232#L703-1true]) [2025-03-08 21:56:36,108 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-08 21:56:36,108 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-08 21:56:36,108 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-08 21:56:36,108 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-08 21:56:36,151 INFO L124 PetriNetUnfolderBase]: 6562/18031 cut-off events. [2025-03-08 21:56:36,152 INFO L125 PetriNetUnfolderBase]: For 7487/8038 co-relation queries the response was YES. [2025-03-08 21:56:36,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35063 conditions, 18031 events. 6562/18031 cut-off events. For 7487/8038 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 202532 event pairs, 2467 based on Foata normal form. 44/15741 useless extension candidates. Maximal degree in co-relation 35020. Up to 7179 conditions per place. [2025-03-08 21:56:36,441 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 33 selfloop transitions, 14 changer transitions 0/215 dead transitions. [2025-03-08 21:56:36,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 215 transitions, 657 flow [2025-03-08 21:56:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:56:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:56:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2025-03-08 21:56:36,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888 [2025-03-08 21:56:36,447 INFO L175 Difference]: Start difference. First operand has 196 places, 197 transitions, 487 flow. Second operand 3 states and 666 transitions. [2025-03-08 21:56:36,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 215 transitions, 657 flow [2025-03-08 21:56:36,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 215 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:36,462 INFO L231 Difference]: Finished difference. Result has 198 places, 209 transitions, 591 flow [2025-03-08 21:56:36,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=198, PETRI_TRANSITIONS=209} [2025-03-08 21:56:36,464 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -6 predicate places. [2025-03-08 21:56:36,464 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 209 transitions, 591 flow [2025-03-08 21:56:36,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:36,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:36,465 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-03-08 21:56:36,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:56:36,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:56:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1884021702, now seen corresponding path program 1 times [2025-03-08 21:56:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:36,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814187250] [2025-03-08 21:56:36,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:36,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 21:56:36,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:56:36,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:36,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:56:36,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:36,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814187250] [2025-03-08 21:56:36,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814187250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:36,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:36,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:56:36,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292325018] [2025-03-08 21:56:36,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:36,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:56:36,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:36,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:56:36,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:56:36,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2025-03-08 21:56:36,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 209 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:36,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:36,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2025-03-08 21:56:36,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:37,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][124], [139#L714-1true, 240#true, 29#L700true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:37,463 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2025-03-08 21:56:37,463 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-08 21:56:37,463 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-08 21:56:37,463 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-08 21:56:37,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 42#L701true, 240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:37,598 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,598 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:56:37,598 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:56:37,598 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][124], [139#L714-1true, 33#L694-4true, 240#true, 29#L700true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:37,722 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,722 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:56:37,722 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:56:37,722 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L701-1true, 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:37,738 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-03-08 21:56:37,738 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-08 21:56:37,738 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-08 21:56:37,738 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:37,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][124], [120#L694-5true, 139#L714-1true, 240#true, 29#L700true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:37,754 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-03-08 21:56:37,754 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:37,754 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-08 21:56:37,754 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-08 21:56:37,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L701-2-->L701: Formula: (= |v_#race~x~0_6| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][199], [120#L694-5true, 139#L714-1true, 42#L701true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true, 232#L703-1true]) [2025-03-08 21:56:37,850 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-08 21:56:37,850 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:37,850 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-08 21:56:37,850 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:37,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][124], [139#L714-1true, 240#true, 29#L700true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:37,897 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2025-03-08 21:56:37,897 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-08 21:56:37,897 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-08 21:56:37,898 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-08 21:56:37,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, 215#L705true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:37,950 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-08 21:56:37,950 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:37,950 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:37,950 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-08 21:56:37,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [139#L714-1true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, 215#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 146#L701true, 271#true, 244#true, 242#true]) [2025-03-08 21:56:37,950 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-03-08 21:56:37,950 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,950 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,951 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 42#L701true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:37,951 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-03-08 21:56:37,951 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,951 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,951 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][124], [139#L714-1true, 240#true, 33#L694-4true, 29#L700true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:37,984 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-03-08 21:56:37,984 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,985 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:37,985 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:56:38,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 211#L701-1true, 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,000 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-08 21:56:38,000 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:38,001 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:38,001 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:38,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][124], [120#L694-5true, 139#L714-1true, 240#true, 29#L700true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,016 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-08 21:56:38,016 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:38,016 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:38,016 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:56:38,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 240#true, 33#L694-4true, Black: 261#true, 266#true, 246#true, 215#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,028 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-08 21:56:38,028 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-08 21:56:38,028 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-08 21:56:38,028 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-08 21:56:38,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [120#L694-5true, 139#L714-1true, 240#true, Black: 261#true, 266#true, 246#true, 215#L705true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,060 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-08 21:56:38,060 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-08 21:56:38,060 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-08 21:56:38,060 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-08 21:56:38,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, 215#L705true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,090 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2025-03-08 21:56:38,090 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-03-08 21:56:38,090 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-03-08 21:56:38,090 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2025-03-08 21:56:38,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 214#L703true, 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,091 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2025-03-08 21:56:38,091 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-08 21:56:38,091 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-08 21:56:38,091 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-08 21:56:38,181 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, 215#L705true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,181 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-03-08 21:56:38,181 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-08 21:56:38,181 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-08 21:56:38,181 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-08 21:56:38,181 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-08 21:56:38,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 240#true, Black: 261#true, 266#true, 246#true, 215#L705true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 7#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,209 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-08 21:56:38,209 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-08 21:56:38,209 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-08 21:56:38,209 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-08 21:56:38,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [139#L714-1true, 240#true, 33#L694-4true, Black: 263#(= |#race~x~0| 0), 266#true, 215#L705true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,359 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-03-08 21:56:38,359 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-08 21:56:38,359 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-08 21:56:38,359 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-08 21:56:38,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [120#L694-5true, 139#L714-1true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, 215#L705true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,394 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-08 21:56:38,394 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-08 21:56:38,394 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-08 21:56:38,394 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-08 21:56:38,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([806] L701-2-->L701: Formula: (= |v_#race~x~0_6| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][208], [120#L694-5true, 240#true, Black: 261#true, 266#true, 246#true, 215#L705true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 146#L701true, 271#true, 244#true, 242#true, 232#L703-1true]) [2025-03-08 21:56:38,539 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,539 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-08 21:56:38,539 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-08 21:56:38,539 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [240#true, 33#L694-4true, Black: 263#(= |#race~x~0| 0), 266#true, 215#L705true, 246#true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 115#L700true, 271#true, 244#true, 242#true]) [2025-03-08 21:56:38,562 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2025-03-08 21:56:38,562 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-08 21:56:38,562 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-08 21:56:38,562 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-08 21:56:38,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [120#L694-5true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 215#L705true, 246#true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 115#L700true, 271#true, 244#true, 242#true]) [2025-03-08 21:56:38,601 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,601 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-08 21:56:38,601 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-08 21:56:38,601 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-08 21:56:38,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 215#L705true, 246#true, 153#L-1true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,632 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,632 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,632 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,632 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-08 21:56:38,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([806] L701-2-->L701: Formula: (= |v_#race~x~0_6| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][177], [120#L694-5true, 240#true, Black: 261#true, 266#true, 215#L705true, 246#true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 146#L701true, 271#true, 74#L705-3true, 244#true, 242#true]) [2025-03-08 21:56:38,633 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-03-08 21:56:38,633 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-08 21:56:38,633 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-08 21:56:38,633 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-08 21:56:38,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [240#true, Black: 261#true, 266#true, 246#true, 215#L705true, 153#L-1true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 7#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 13#L705true]) [2025-03-08 21:56:38,716 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-03-08 21:56:38,716 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-03-08 21:56:38,716 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-03-08 21:56:38,716 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-03-08 21:56:38,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 215#L705true, 246#true, 153#L-1true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 138#L703true, 244#true, 242#true]) [2025-03-08 21:56:38,726 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-08 21:56:38,726 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-08 21:56:38,726 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-08 21:56:38,726 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-08 21:56:38,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [240#true, 33#L694-4true, Black: 261#true, 246#true, 105#L703true, 215#L705true, 153#L-1true, Black: 266#true, 260#(= |#race~n~0| 0), 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,749 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-08 21:56:38,749 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-03-08 21:56:38,749 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-03-08 21:56:38,749 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-08 21:56:38,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [120#L694-5true, 240#true, Black: 261#true, 105#L703true, 246#true, 153#L-1true, 215#L705true, Black: 266#true, 260#(= |#race~n~0| 0), 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,762 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-08 21:56:38,762 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,762 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,762 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-08 21:56:38,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [240#true, Black: 261#true, 215#L705true, 246#true, 105#L703true, 153#L-1true, Black: 266#true, 260#(= |#race~n~0| 0), 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 7#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 13#L705true]) [2025-03-08 21:56:38,771 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-08 21:56:38,771 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,771 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-08 21:56:38,771 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 153#L-1true, 246#true, 215#L705true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2025-03-08 21:56:38,774 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-08 21:56:38,774 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,774 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,774 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-08 21:56:38,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [240#true, Black: 261#true, 266#true, 215#L705true, 246#true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 7#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 13#L705true]) [2025-03-08 21:56:38,787 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-03-08 21:56:38,787 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-03-08 21:56:38,787 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-03-08 21:56:38,787 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-03-08 21:56:38,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][124], [240#true, Black: 261#true, 266#true, 246#true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 214#L703true, 271#true, 244#true, 242#true, 7#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 13#L705true]) [2025-03-08 21:56:38,802 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-08 21:56:38,802 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-08 21:56:38,802 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-08 21:56:38,802 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-08 21:56:38,832 INFO L124 PetriNetUnfolderBase]: 7415/26147 cut-off events. [2025-03-08 21:56:38,832 INFO L125 PetriNetUnfolderBase]: For 6164/10679 co-relation queries the response was YES. [2025-03-08 21:56:38,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45263 conditions, 26147 events. 7415/26147 cut-off events. For 6164/10679 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 340837 event pairs, 2911 based on Foata normal form. 7/22172 useless extension candidates. Maximal degree in co-relation 45219. Up to 4819 conditions per place. [2025-03-08 21:56:39,064 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 22 selfloop transitions, 0 changer transitions 4/212 dead transitions. [2025-03-08 21:56:39,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 212 transitions, 649 flow [2025-03-08 21:56:39,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:56:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 21:56:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1077 transitions. [2025-03-08 21:56:39,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8616 [2025-03-08 21:56:39,066 INFO L175 Difference]: Start difference. First operand has 198 places, 209 transitions, 591 flow. Second operand 5 states and 1077 transitions. [2025-03-08 21:56:39,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 212 transitions, 649 flow [2025-03-08 21:56:39,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 212 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:56:39,104 INFO L231 Difference]: Finished difference. Result has 203 places, 208 transitions, 567 flow [2025-03-08 21:56:39,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=203, PETRI_TRANSITIONS=208} [2025-03-08 21:56:39,105 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -1 predicate places. [2025-03-08 21:56:39,105 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 208 transitions, 567 flow [2025-03-08 21:56:39,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:56:39,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:39,105 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] [2025-03-08 21:56:39,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:56:39,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:56:39,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash 802422019, now seen corresponding path program 1 times [2025-03-08 21:56:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:39,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141922109] [2025-03-08 21:56:39,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:39,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 21:56:39,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 21:56:39,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:39,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:39,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:56:39,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 21:56:39,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 21:56:39,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:39,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:39,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:56:39,140 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:56:39,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-03-08 21:56:39,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-08 21:56:39,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-08 21:56:39,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-08 21:56:39,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-08 21:56:39,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-08 21:56:39,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-08 21:56:39,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-08 21:56:39,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-08 21:56:39,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-08 21:56:39,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-08 21:56:39,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-08 21:56:39,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-08 21:56:39,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:56:39,143 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:39,220 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2025-03-08 21:56:39,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:56:39,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:56:39 BasicIcfg [2025-03-08 21:56:39,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:56:39,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:56:39,228 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:56:39,228 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:56:39,229 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:27" (3/4) ... [2025-03-08 21:56:39,230 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:56:39,313 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 10. [2025-03-08 21:56:39,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:56:39,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:56:39,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:56:39,360 INFO L158 Benchmark]: Toolchain (without parser) took 12856.78ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 112.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 819.7MB. Max. memory is 16.1GB. [2025-03-08 21:56:39,361 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:56:39,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.24ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 92.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:56:39,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.84ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:56:39,361 INFO L158 Benchmark]: Boogie Preprocessor took 19.72ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 89.4MB in the end (delta: 892.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:56:39,361 INFO L158 Benchmark]: IcfgBuilder took 303.43ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 72.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:56:39,361 INFO L158 Benchmark]: TraceAbstraction took 12044.72ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 72.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 744.2MB. Max. memory is 16.1GB. [2025-03-08 21:56:39,362 INFO L158 Benchmark]: Witness Printer took 128.17ms. Allocated memory is still 2.9GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 21:56:39,363 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.24ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 92.3MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.84ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.72ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 89.4MB in the end (delta: 892.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 303.43ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 72.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12044.72ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 72.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 744.2MB. Max. memory is 16.1GB. * Witness Printer took 128.17ms. Allocated memory is still 2.9GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mut={3:0}, n=0, x=0] [L708] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L709] 0 x = 0 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L710] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] EXPR 0 n >= (10/2) && n < 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] EXPR 0 n < 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] EXPR 0 n >= (10/2) && n < 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, x=0] [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n < 10) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=7, x=0] [L711] RET 0 assume_abort_if_not(n >= (10/2) && n < 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=7, t1=-1, x=0] [L694] 1 x <= n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=7, x=0] [L713] 0 int i = 0; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=7, t1=-1, x=0] [L713] COND TRUE 0 i < n [L713] 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=7, t1=-1, x=0] [L713] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=7, t1=-1, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=7, t1=-1, t2=0, x=0] [L697] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=7, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, x=0] [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=7, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L701] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L702] 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L702] COND TRUE 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=0] [L703] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, k=7, mut={3:0}, n=7, t=0, x=1] [L694] 1 x <= n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=7, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x <= n [694] - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 185 locations, 194 edges, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 45 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 237 locations, 250 edges, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 36 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=5, InterpolantAutomatonStates: 20, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 289 locations, 306 edges, 27 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: 8.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 392 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 22 mSDtfsCounter, 392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=5, InterpolantAutomatonStates: 20, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 21:56:39,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)