./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/40_barrier_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-ext/40_barrier_vf.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 e83225601d835c9b02ede9a5751213533e33817a9795ca1ab6ec7c2abd672056 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:09:21,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:09:21,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:09:21,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:09:21,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:09:21,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:09:21,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:09:21,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:09:21,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:09:21,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:09:21,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:09:21,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:09:21,654 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:09:21,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:09:21,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:09:21,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:09:21,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:09:21,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:09:21,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:09:21,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:09:21,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:09:21,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:09:21,661 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:09:21,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:09:21,661 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:09:21,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:09:21,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:09:21,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:09:21,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:09:21,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:09:21,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:09:21,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:09:21,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:09:21,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:09:21,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:09:21,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:09:21,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:09:21,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:09:21,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:09:21,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:09:21,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:09:21,666 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e83225601d835c9b02ede9a5751213533e33817a9795ca1ab6ec7c2abd672056 [2024-11-10 14:09:21,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:09:21,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:09:21,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:09:21,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:09:21,986 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:09:21,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2024-11-10 14:09:23,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:09:23,719 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:09:23,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2024-11-10 14:09:23,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c064cff2d/08bc02ce303548d8bc4bbff2cb9ae555/FLAG3b76eba5d [2024-11-10 14:09:23,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c064cff2d/08bc02ce303548d8bc4bbff2cb9ae555 [2024-11-10 14:09:23,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:09:23,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:09:23,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:09:23,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:09:23,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:09:23,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:09:23" (1/1) ... [2024-11-10 14:09:23,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148f9bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:23, skipping insertion in model container [2024-11-10 14:09:23,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:09:23" (1/1) ... [2024-11-10 14:09:23,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:09:24,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:09:24,203 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:09:24,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:09:24,296 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:09:24,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24 WrapperNode [2024-11-10 14:09:24,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:09:24,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:09:24,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:09:24,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:09:24,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,348 INFO L138 Inliner]: procedures = 164, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 190 [2024-11-10 14:09:24,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:09:24,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:09:24,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:09:24,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:09:24,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:09:24,394 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:09:24,394 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:09:24,394 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:09:24,395 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (1/1) ... [2024-11-10 14:09:24,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:09:24,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:09:24,436 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) [2024-11-10 14:09:24,438 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 [2024-11-10 14:09:24,494 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-10 14:09:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-10 14:09:24,494 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:09:24,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:09:24,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:09:24,495 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:09:24,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:09:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:09:24,496 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:09:24,642 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:09:24,644 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:09:24,938 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:09:24,939 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:09:24,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:09:24,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:09:24,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:09:24 BoogieIcfgContainer [2024-11-10 14:09:24,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:09:24,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:09:24,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:09:24,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:09:24,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:09:23" (1/3) ... [2024-11-10 14:09:24,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4543bfb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:09:24, skipping insertion in model container [2024-11-10 14:09:24,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:09:24" (2/3) ... [2024-11-10 14:09:24,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4543bfb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:09:24, skipping insertion in model container [2024-11-10 14:09:24,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:09:24" (3/3) ... [2024-11-10 14:09:24,985 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2024-11-10 14:09:25,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:09:25,001 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 14:09:25,002 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:09:25,076 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:09:25,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 203 transitions, 410 flow [2024-11-10 14:09:25,206 INFO L124 PetriNetUnfolderBase]: 7/213 cut-off events. [2024-11-10 14:09:25,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:09:25,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 213 events. 7/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 125 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 146. Up to 4 conditions per place. [2024-11-10 14:09:25,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 203 transitions, 410 flow [2024-11-10 14:09:25,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 203 transitions, 410 flow [2024-11-10 14:09:25,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:09:25,238 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;@7f636b29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:09:25,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-10 14:09:25,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:09:25,275 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:09:25,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:09:25,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:25,276 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:25,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:09:25,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:25,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1610340629, now seen corresponding path program 1 times [2024-11-10 14:09:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282229429] [2024-11-10 14:09:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:09:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:09:25,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:09:25,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282229429] [2024-11-10 14:09:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282229429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:09:25,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:09:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:09:25,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396723861] [2024-11-10 14:09:25,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:09:25,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:09:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:09:25,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:09:25,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:09:25,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 203 [2024-11-10 14:09:25,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 203 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 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) [2024-11-10 14:09:25,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:09:25,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 203 [2024-11-10 14:09:25,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:09:25,891 INFO L124 PetriNetUnfolderBase]: 1/199 cut-off events. [2024-11-10 14:09:25,891 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:09:25,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 199 events. 1/199 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 31/224 useless extension candidates. Maximal degree in co-relation 67. Up to 7 conditions per place. [2024-11-10 14:09:25,894 INFO L140 encePairwiseOnDemand]: 191/203 looper letters, 8 selfloop transitions, 4 changer transitions 0/189 dead transitions. [2024-11-10 14:09:25,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 189 transitions, 406 flow [2024-11-10 14:09:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:09:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:09:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2024-11-10 14:09:25,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9425287356321839 [2024-11-10 14:09:25,919 INFO L175 Difference]: Start difference. First operand has 200 places, 203 transitions, 410 flow. Second operand 3 states and 574 transitions. [2024-11-10 14:09:25,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 189 transitions, 406 flow [2024-11-10 14:09:25,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 189 transitions, 406 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:09:25,931 INFO L231 Difference]: Finished difference. Result has 191 places, 188 transitions, 388 flow [2024-11-10 14:09:25,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=191, PETRI_TRANSITIONS=188} [2024-11-10 14:09:25,940 INFO L277 CegarLoopForPetriNet]: 200 programPoint places, -9 predicate places. [2024-11-10 14:09:25,940 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 188 transitions, 388 flow [2024-11-10 14:09:25,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 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) [2024-11-10 14:09:25,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:25,942 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:25,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:09:25,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:09:25,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1514791851, now seen corresponding path program 1 times [2024-11-10 14:09:25,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:25,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446417292] [2024-11-10 14:09:25,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:09:26,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:09:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:09:26,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:09:26,161 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:09:26,163 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-10 14:09:26,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-10 14:09:26,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-10 14:09:26,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-10 14:09:26,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-10 14:09:26,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-10 14:09:26,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-10 14:09:26,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-10 14:09:26,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-10 14:09:26,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-10 14:09:26,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-10 14:09:26,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-10 14:09:26,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-10 14:09:26,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:09:26,169 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 14:09:26,172 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:09:26,173 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:09:26,215 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:09:26,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 257 transitions, 524 flow [2024-11-10 14:09:26,269 INFO L124 PetriNetUnfolderBase]: 13/279 cut-off events. [2024-11-10 14:09:26,270 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:09:26,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 279 events. 13/279 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 361 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 214. Up to 6 conditions per place. [2024-11-10 14:09:26,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 257 transitions, 524 flow [2024-11-10 14:09:26,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 257 transitions, 524 flow [2024-11-10 14:09:26,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:09:26,280 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;@7f636b29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:09:26,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-10 14:09:26,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:09:26,296 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:09:26,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:09:26,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:26,297 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:26,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-10 14:09:26,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:26,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1818355030, now seen corresponding path program 1 times [2024-11-10 14:09:26,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:26,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740335797] [2024-11-10 14:09:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:26,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:09:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:09:26,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:09:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740335797] [2024-11-10 14:09:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740335797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:09:26,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:09:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:09:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465061708] [2024-11-10 14:09:26,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:09:26,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:09:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:09:26,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:09:26,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:09:26,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 257 [2024-11-10 14:09:26,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 257 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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) [2024-11-10 14:09:26,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:09:26,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 257 [2024-11-10 14:09:26,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:09:26,777 INFO L124 PetriNetUnfolderBase]: 190/1253 cut-off events. [2024-11-10 14:09:26,778 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-10 14:09:26,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 1253 events. 190/1253 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8193 event pairs, 50 based on Foata normal form. 559/1645 useless extension candidates. Maximal degree in co-relation 1398. Up to 233 conditions per place. [2024-11-10 14:09:26,793 INFO L140 encePairwiseOnDemand]: 231/257 looper letters, 35 selfloop transitions, 12 changer transitions 0/257 dead transitions. [2024-11-10 14:09:26,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 257 transitions, 623 flow [2024-11-10 14:09:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:09:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:09:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-11-10 14:09:26,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442282749675746 [2024-11-10 14:09:26,798 INFO L175 Difference]: Start difference. First operand has 251 places, 257 transitions, 524 flow. Second operand 3 states and 728 transitions. [2024-11-10 14:09:26,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 257 transitions, 623 flow [2024-11-10 14:09:26,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 257 transitions, 623 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:09:26,810 INFO L231 Difference]: Finished difference. Result has 241 places, 248 transitions, 586 flow [2024-11-10 14:09:26,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=241, PETRI_TRANSITIONS=248} [2024-11-10 14:09:26,814 INFO L277 CegarLoopForPetriNet]: 251 programPoint places, -10 predicate places. [2024-11-10 14:09:26,815 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 248 transitions, 586 flow [2024-11-10 14:09:26,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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) [2024-11-10 14:09:26,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:26,816 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:09:26,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-10 14:09:26,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1485734437, now seen corresponding path program 1 times [2024-11-10 14:09:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348795630] [2024-11-10 14:09:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:09:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:09:26,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:09:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348795630] [2024-11-10 14:09:26,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348795630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:09:26,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:09:26,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:09:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595691660] [2024-11-10 14:09:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:09:26,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:09:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:09:26,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:09:26,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:09:27,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 257 [2024-11-10 14:09:27,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 248 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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) [2024-11-10 14:09:27,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:09:27,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 257 [2024-11-10 14:09:27,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:09:27,323 INFO L124 PetriNetUnfolderBase]: 279/1557 cut-off events. [2024-11-10 14:09:27,323 INFO L125 PetriNetUnfolderBase]: For 378/393 co-relation queries the response was YES. [2024-11-10 14:09:27,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 1557 events. 279/1557 cut-off events. For 378/393 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 11079 event pairs, 99 based on Foata normal form. 3/1337 useless extension candidates. Maximal degree in co-relation 2162. Up to 446 conditions per place. [2024-11-10 14:09:27,338 INFO L140 encePairwiseOnDemand]: 249/257 looper letters, 35 selfloop transitions, 10 changer transitions 0/261 dead transitions. [2024-11-10 14:09:27,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 261 transitions, 727 flow [2024-11-10 14:09:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:09:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:09:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2024-11-10 14:09:27,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9066147859922179 [2024-11-10 14:09:27,341 INFO L175 Difference]: Start difference. First operand has 241 places, 248 transitions, 586 flow. Second operand 3 states and 699 transitions. [2024-11-10 14:09:27,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 261 transitions, 727 flow [2024-11-10 14:09:27,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 261 transitions, 695 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:09:27,349 INFO L231 Difference]: Finished difference. Result has 243 places, 256 transitions, 648 flow [2024-11-10 14:09:27,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=243, PETRI_TRANSITIONS=256} [2024-11-10 14:09:27,352 INFO L277 CegarLoopForPetriNet]: 251 programPoint places, -8 predicate places. [2024-11-10 14:09:27,352 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 256 transitions, 648 flow [2024-11-10 14:09:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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) [2024-11-10 14:09:27,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:27,354 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:27,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:09:27,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2024-11-10 14:09:27,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2037126618, now seen corresponding path program 1 times [2024-11-10 14:09:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575370973] [2024-11-10 14:09:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:09:27,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:09:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:09:27,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:09:27,470 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:09:27,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2024-11-10 14:09:27,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2024-11-10 14:09:27,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2024-11-10 14:09:27,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2024-11-10 14:09:27,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2024-11-10 14:09:27,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2024-11-10 14:09:27,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2024-11-10 14:09:27,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2024-11-10 14:09:27,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2024-11-10 14:09:27,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2024-11-10 14:09:27,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2024-11-10 14:09:27,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2024-11-10 14:09:27,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2024-11-10 14:09:27,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2024-11-10 14:09:27,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2024-11-10 14:09:27,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2024-11-10 14:09:27,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2024-11-10 14:09:27,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2024-11-10 14:09:27,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2024-11-10 14:09:27,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:09:27,478 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 14:09:27,478 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:09:27,479 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:09:27,527 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:09:27,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 311 transitions, 640 flow [2024-11-10 14:09:27,588 INFO L124 PetriNetUnfolderBase]: 19/345 cut-off events. [2024-11-10 14:09:27,588 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:09:27,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 345 events. 19/345 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 664 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 283. Up to 8 conditions per place. [2024-11-10 14:09:27,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 311 transitions, 640 flow [2024-11-10 14:09:27,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 311 transitions, 640 flow [2024-11-10 14:09:27,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:09:27,596 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;@7f636b29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:09:27,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-10 14:09:27,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:09:27,611 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:09:27,611 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:09:27,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:27,611 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:27,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-11-10 14:09:27,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2122236895, now seen corresponding path program 1 times [2024-11-10 14:09:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:27,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518292430] [2024-11-10 14:09:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:09:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:09:27,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:09:27,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518292430] [2024-11-10 14:09:27,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518292430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:09:27,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:09:27,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:09:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597635754] [2024-11-10 14:09:27,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:09:27,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:09:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:09:27,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:09:27,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:09:27,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 311 [2024-11-10 14:09:27,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 311 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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) [2024-11-10 14:09:27,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:09:27,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 311 [2024-11-10 14:09:27,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:09:30,871 INFO L124 PetriNetUnfolderBase]: 6066/20052 cut-off events. [2024-11-10 14:09:30,872 INFO L125 PetriNetUnfolderBase]: For 1099/1099 co-relation queries the response was YES. [2024-11-10 14:09:30,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29795 conditions, 20052 events. 6066/20052 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 235703 event pairs, 1847 based on Foata normal form. 9556/26370 useless extension candidates. Maximal degree in co-relation 27068. Up to 5358 conditions per place. [2024-11-10 14:09:31,077 INFO L140 encePairwiseOnDemand]: 273/311 looper letters, 53 selfloop transitions, 18 changer transitions 0/314 dead transitions. [2024-11-10 14:09:31,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 314 transitions, 800 flow [2024-11-10 14:09:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:09:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:09:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2024-11-10 14:09:31,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.932475884244373 [2024-11-10 14:09:31,080 INFO L175 Difference]: Start difference. First operand has 302 places, 311 transitions, 640 flow. Second operand 3 states and 870 transitions. [2024-11-10 14:09:31,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 314 transitions, 800 flow [2024-11-10 14:09:31,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 314 transitions, 796 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-10 14:09:31,087 INFO L231 Difference]: Finished difference. Result has 287 places, 300 transitions, 736 flow [2024-11-10 14:09:31,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=287, PETRI_TRANSITIONS=300} [2024-11-10 14:09:31,089 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -15 predicate places. [2024-11-10 14:09:31,089 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 300 transitions, 736 flow [2024-11-10 14:09:31,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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) [2024-11-10 14:09:31,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:31,090 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:31,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:09:31,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-11-10 14:09:31,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1471410493, now seen corresponding path program 1 times [2024-11-10 14:09:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848940351] [2024-11-10 14:09:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:09:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:09:31,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:09:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848940351] [2024-11-10 14:09:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848940351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:09:31,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:09:31,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:09:31,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947366109] [2024-11-10 14:09:31,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:09:31,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:09:31,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:09:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:09:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:09:31,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 311 [2024-11-10 14:09:31,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 300 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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) [2024-11-10 14:09:31,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:09:31,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 311 [2024-11-10 14:09:31,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:09:33,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1120] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][301], [170#L693-1true, Black: 305#true, 299#true, 251#L693-7true, 303#true, 301#true, 6#L709-2true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 117#L701true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:33,348 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2024-11-10 14:09:33,348 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:09:33,348 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-11-10 14:09:33,348 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:09:33,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1120] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][251], [310#true, Black: 305#true, 299#true, 251#L693-7true, 303#true, 301#true, 6#L709-2true, 117#L701true, 307#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-10 14:09:33,351 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2024-11-10 14:09:33,351 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-11-10 14:09:33,351 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:09:33,351 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:09:33,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][322], [170#L693-1true, 299#true, Black: 305#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 207#L693-7true, 54#L701true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:33,359 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2024-11-10 14:09:33,360 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:09:33,360 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-11-10 14:09:33,360 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:09:33,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][295], [310#true, 299#true, Black: 305#true, 303#true, 301#true, 6#L709-2true, 207#L693-7true, 54#L701true, 307#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-10 14:09:33,361 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2024-11-10 14:09:33,361 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-11-10 14:09:33,361 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:09:33,361 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-11-10 14:09:34,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][322], [170#L693-1true, 189#L694-1true, 299#true, Black: 305#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 54#L701true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:34,222 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,222 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2024-11-10 14:09:34,222 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-11-10 14:09:34,222 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2024-11-10 14:09:34,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][295], [310#true, 189#L694-1true, 299#true, Black: 305#true, 303#true, 301#true, 6#L709-2true, 54#L701true, 307#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-10 14:09:34,229 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2024-11-10 14:09:34,230 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2024-11-10 14:09:34,230 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2024-11-10 14:09:34,230 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][295], [310#true, 299#true, Black: 305#true, 303#true, 190#L693-3true, 301#true, 6#L709-2true, 117#L701true, 54#L701true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:34,587 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2024-11-10 14:09:34,587 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,587 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-10 14:09:34,587 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-10 14:09:34,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][295], [310#true, 299#true, Black: 305#true, 303#true, 190#L693-3true, 301#true, 6#L709-2true, 54#L701true, 307#(= |#race~count~0| 0), 150#L700-2true]) [2024-11-10 14:09:34,588 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2024-11-10 14:09:34,588 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-10 14:09:34,588 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-10 14:09:34,588 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1120] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][301], [170#L693-1true, 299#true, Black: 305#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 117#L701true, 54#L701true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:34,665 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,665 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,665 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,665 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1120] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][301], [170#L693-1true, Black: 305#true, 299#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 117#L701true, 226#L699true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:34,666 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-11-10 14:09:34,666 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,666 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,666 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1120] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][301], [170#L693-1true, 299#true, Black: 305#true, 303#true, 301#true, 6#L709-2true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 117#L701true, 218#L700-2true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:34,666 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,666 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,666 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,666 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][302], [170#L693-1true, 299#true, Black: 305#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 54#L701true, 307#(= |#race~count~0| 0), 150#L700-2true]) [2024-11-10 14:09:34,667 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,667 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,667 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,667 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][302], [170#L693-1true, Black: 305#true, 299#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 226#L699true, 307#(= |#race~count~0| 0), 150#L700-2true]) [2024-11-10 14:09:34,667 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-11-10 14:09:34,667 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,668 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,668 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1127] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret6#1][302], [170#L693-1true, 299#true, Black: 305#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 218#L700-2true, 307#(= |#race~count~0| 0), 150#L700-2true]) [2024-11-10 14:09:34,668 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,668 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,668 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,668 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][322], [170#L693-1true, Black: 305#true, 299#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 117#L701true, 54#L701true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:34,669 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,669 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,669 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-11-10 14:09:34,670 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][322], [170#L693-1true, 299#true, Black: 305#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 54#L701true, 307#(= |#race~count~0| 0), 150#L700-2true]) [2024-11-10 14:09:34,671 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,671 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,672 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-11-10 14:09:34,672 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][295], [310#true, 299#true, Black: 305#true, 303#true, 301#true, 6#L709-2true, 117#L701true, 54#L701true, 307#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-10 14:09:34,676 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,676 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,676 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,676 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-11-10 14:09:34,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][295], [310#true, 299#true, Black: 305#true, 303#true, 301#true, 6#L709-2true, 54#L701true, 307#(= |#race~count~0| 0), 23#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 150#L700-2true]) [2024-11-10 14:09:34,677 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-10 14:09:34,677 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,677 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:34,677 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-11-10 14:09:34,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][322], [170#L693-1true, 299#true, Black: 305#true, 303#true, 301#true, 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 6#L709-2true, 173#L699true, 54#L701true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:34,705 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-11-10 14:09:34,705 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,705 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-11-10 14:09:34,705 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-11-10 14:09:34,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][295], [310#true, 299#true, Black: 305#true, 303#true, 301#true, 6#L709-2true, 173#L699true, 54#L701true, 222#L694-2true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:34,768 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2024-11-10 14:09:34,768 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-10 14:09:34,768 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-10 14:09:34,768 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-10 14:09:34,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L700-5-->L700-2: Formula: (and (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#MTX~0.base_17| (store (select |v_#pthreadsMutex_22| |v_~#MTX~0.base_17|) |v_~#MTX~0.offset_17| 0))) (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_3| 0)) InVars {~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_22|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_17|, #pthreadsMutex=|v_#pthreadsMutex_21|, ~#MTX~0.offset=|v_~#MTX~0.offset_17|, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret6#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret6#1][296], [310#true, 299#true, Black: 305#true, 303#true, 301#true, 6#L709-2true, 173#L699true, 218#L700-2true, 222#L694-2true, 307#(= |#race~count~0| 0)]) [2024-11-10 14:09:34,768 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2024-11-10 14:09:34,768 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-10 14:09:34,768 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-10 14:09:34,769 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-11-10 14:09:35,079 INFO L124 PetriNetUnfolderBase]: 8327/27853 cut-off events. [2024-11-10 14:09:35,079 INFO L125 PetriNetUnfolderBase]: For 8649/9404 co-relation queries the response was YES. [2024-11-10 14:09:35,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48596 conditions, 27853 events. 8327/27853 cut-off events. For 8649/9404 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 350222 event pairs, 3141 based on Foata normal form. 56/23130 useless extension candidates. Maximal degree in co-relation 48289. Up to 10171 conditions per place. [2024-11-10 14:09:35,312 INFO L140 encePairwiseOnDemand]: 299/311 looper letters, 53 selfloop transitions, 20 changer transitions 0/328 dead transitions. [2024-11-10 14:09:35,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 328 transitions, 996 flow [2024-11-10 14:09:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:09:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:09:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2024-11-10 14:09:35,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971061093247589 [2024-11-10 14:09:35,316 INFO L175 Difference]: Start difference. First operand has 287 places, 300 transitions, 736 flow. Second operand 3 states and 837 transitions. [2024-11-10 14:09:35,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 328 transitions, 996 flow [2024-11-10 14:09:35,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 328 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:09:35,342 INFO L231 Difference]: Finished difference. Result has 289 places, 318 transitions, 886 flow [2024-11-10 14:09:35,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=289, PETRI_TRANSITIONS=318} [2024-11-10 14:09:35,345 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -13 predicate places. [2024-11-10 14:09:35,345 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 318 transitions, 886 flow [2024-11-10 14:09:35,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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) [2024-11-10 14:09:35,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:35,346 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:35,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:09:35,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-11-10 14:09:35,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1925996438, now seen corresponding path program 1 times [2024-11-10 14:09:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142189155] [2024-11-10 14:09:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:35,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:09:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:09:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:09:35,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142189155] [2024-11-10 14:09:35,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142189155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:09:35,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:09:35,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:09:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439466419] [2024-11-10 14:09:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:09:35,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:09:35,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:09:35,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:09:35,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:09:35,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 311 [2024-11-10 14:09:35,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 318 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 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) [2024-11-10 14:09:35,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:09:35,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 311 [2024-11-10 14:09:35,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:09:38,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][324], [310#true, 299#true, Black: 307#(= |#race~count~0| 0), 303#true, 301#true, 315#true, 276#L692true, 6#L709-2true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 54#L701true, 258#L701true]) [2024-11-10 14:09:38,185 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-11-10 14:09:38,185 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-11-10 14:09:38,185 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-11-10 14:09:38,185 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-11-10 14:09:38,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][227], [310#true, 317#(= |#race~COND~0| 0), 299#true, Black: 305#true, 303#true, 301#true, 6#L709-2true, 100#L695-1true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 219#L699-2true, 54#L701true]) [2024-11-10 14:09:38,671 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2024-11-10 14:09:38,671 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-10 14:09:38,671 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2024-11-10 14:09:38,671 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2024-11-10 14:09:39,018 INFO L124 PetriNetUnfolderBase]: 8182/31594 cut-off events. [2024-11-10 14:09:39,018 INFO L125 PetriNetUnfolderBase]: For 3962/4413 co-relation queries the response was YES. [2024-11-10 14:09:39,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51055 conditions, 31594 events. 8182/31594 cut-off events. For 3962/4413 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 426778 event pairs, 2470 based on Foata normal form. 28/27342 useless extension candidates. Maximal degree in co-relation 50783. Up to 7538 conditions per place. [2024-11-10 14:09:39,520 INFO L140 encePairwiseOnDemand]: 299/311 looper letters, 41 selfloop transitions, 9 changer transitions 0/341 dead transitions. [2024-11-10 14:09:39,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 341 transitions, 1042 flow [2024-11-10 14:09:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:09:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:09:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-11-10 14:09:39,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9153269024651661 [2024-11-10 14:09:39,523 INFO L175 Difference]: Start difference. First operand has 289 places, 318 transitions, 886 flow. Second operand 3 states and 854 transitions. [2024-11-10 14:09:39,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 341 transitions, 1042 flow [2024-11-10 14:09:39,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 341 transitions, 1002 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:09:39,548 INFO L231 Difference]: Finished difference. Result has 291 places, 327 transitions, 924 flow [2024-11-10 14:09:39,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=924, PETRI_PLACES=291, PETRI_TRANSITIONS=327} [2024-11-10 14:09:39,549 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -11 predicate places. [2024-11-10 14:09:39,550 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 327 transitions, 924 flow [2024-11-10 14:09:39,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 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) [2024-11-10 14:09:39,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:39,551 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:39,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:09:39,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-11-10 14:09:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash -937803806, now seen corresponding path program 1 times [2024-11-10 14:09:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:39,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417773060] [2024-11-10 14:09:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:09:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 14:09:39,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:09:39,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417773060] [2024-11-10 14:09:39,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417773060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:09:39,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:09:39,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:09:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335430999] [2024-11-10 14:09:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:09:39,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:09:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:09:39,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:09:39,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:09:39,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 311 [2024-11-10 14:09:39,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 327 transitions, 924 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 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) [2024-11-10 14:09:39,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:09:39,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 311 [2024-11-10 14:09:39,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:09:42,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1062] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][203], [317#(= |#race~COND~0| 0), Black: 305#true, 299#true, 303#true, 301#true, 6#L709-2true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 320#true, 68#L699-2true, 89#L699-2true, 94#L693-3true, Black: 315#true]) [2024-11-10 14:09:42,847 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2024-11-10 14:09:42,848 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-10 14:09:42,848 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-10 14:09:42,848 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-11-10 14:09:42,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1062] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][203], [317#(= |#race~COND~0| 0), Black: 305#true, 299#true, 303#true, 221#L699-1true, 301#true, 6#L709-2true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 320#true, 68#L699-2true, 94#L693-3true, Black: 315#true]) [2024-11-10 14:09:42,865 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2024-11-10 14:09:42,865 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2024-11-10 14:09:42,865 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-10 14:09:42,865 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-10 14:09:44,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][304], [317#(= |#race~COND~0| 0), 299#true, Black: 305#true, 303#true, 301#true, 6#L709-2true, 320#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 54#L701true, Black: 315#true, 94#L693-3true, 258#L701true]) [2024-11-10 14:09:44,080 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-10 14:09:44,081 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-10 14:09:44,081 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-10 14:09:44,081 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-10 14:09:44,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1120] L701-3-->L701: Formula: (and (= |v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~ret8#1_3|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_Barrier2_#t~ret8#1][252], [5#L693-2true, 317#(= |#race~COND~0| 0), 299#true, Black: 307#(= |#race~count~0| 0), 303#true, 301#true, 6#L709-2true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 320#true, 117#L701true, Black: 315#true, 258#L701true]) [2024-11-10 14:09:44,196 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-11-10 14:09:44,196 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-11-10 14:09:44,196 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-11-10 14:09:44,197 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-11-10 14:09:44,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][304], [317#(= |#race~COND~0| 0), Black: 305#true, 299#true, 303#true, 301#true, 6#L709-2true, 320#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 159#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 54#L701true, Black: 315#true, 258#L701true]) [2024-11-10 14:09:44,306 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-11-10 14:09:44,306 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:44,306 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-11-10 14:09:44,306 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-11-10 14:09:45,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1140] L697-2-->L697-1: Formula: (= |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet5#1_7| |v_#race~count~0_3|) InVars {thr1Thread2of3ForFork0_Barrier2_#t~nondet5#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet5#1_7|} OutVars{thr1Thread2of3ForFork0_Barrier2_#t~nondet5#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet5#1_7|, #race~count~0=|v_#race~count~0_3|} AuxVars[] AssignedVars[#race~count~0][335], [297#L697-1true, 170#L693-1true, 299#true, Black: 307#(= |#race~count~0| 0), 303#true, 315#true, 301#true, 6#L709-2true, 320#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 54#L701true, Black: 317#(= |#race~COND~0| 0)]) [2024-11-10 14:09:45,004 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2024-11-10 14:09:45,004 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2024-11-10 14:09:45,004 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2024-11-10 14:09:45,004 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2024-11-10 14:09:45,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][304], [317#(= |#race~COND~0| 0), 299#true, Black: 307#(= |#race~count~0| 0), 303#true, 301#true, 6#L709-2true, 320#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 117#L701true, 54#L701true, 222#L694-2true, Black: 315#true]) [2024-11-10 14:09:45,239 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2024-11-10 14:09:45,239 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2024-11-10 14:09:45,239 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2024-11-10 14:09:45,239 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-11-10 14:09:45,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][304], [317#(= |#race~COND~0| 0), 299#true, Black: 307#(= |#race~count~0| 0), 303#true, 301#true, 6#L709-2true, 320#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 187#L704-1true, 54#L701true, 222#L694-2true, Black: 315#true]) [2024-11-10 14:09:45,331 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-11-10 14:09:45,331 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-10 14:09:45,331 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2024-11-10 14:09:45,331 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2024-11-10 14:09:45,435 INFO L124 PetriNetUnfolderBase]: 14967/47717 cut-off events. [2024-11-10 14:09:45,435 INFO L125 PetriNetUnfolderBase]: For 18562/20609 co-relation queries the response was YES. [2024-11-10 14:09:45,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90625 conditions, 47717 events. 14967/47717 cut-off events. For 18562/20609 co-relation queries the response was YES. Maximal size of possible extension queue 1599. Compared 644140 event pairs, 6123 based on Foata normal form. 69/41139 useless extension candidates. Maximal degree in co-relation 90344. Up to 17726 conditions per place. [2024-11-10 14:09:45,928 INFO L140 encePairwiseOnDemand]: 299/311 looper letters, 66 selfloop transitions, 28 changer transitions 0/360 dead transitions. [2024-11-10 14:09:45,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 360 transitions, 1259 flow [2024-11-10 14:09:45,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:09:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:09:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2024-11-10 14:09:45,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8960342979635584 [2024-11-10 14:09:45,931 INFO L175 Difference]: Start difference. First operand has 291 places, 327 transitions, 924 flow. Second operand 3 states and 836 transitions. [2024-11-10 14:09:45,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 360 transitions, 1259 flow [2024-11-10 14:09:46,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 360 transitions, 1241 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:09:46,189 INFO L231 Difference]: Finished difference. Result has 293 places, 351 transitions, 1192 flow [2024-11-10 14:09:46,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1192, PETRI_PLACES=293, PETRI_TRANSITIONS=351} [2024-11-10 14:09:46,191 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -9 predicate places. [2024-11-10 14:09:46,191 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 351 transitions, 1192 flow [2024-11-10 14:09:46,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 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) [2024-11-10 14:09:46,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:46,192 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:46,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:09:46,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-11-10 14:09:46,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:46,193 INFO L85 PathProgramCache]: Analyzing trace with hash 247406605, now seen corresponding path program 1 times [2024-11-10 14:09:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874084687] [2024-11-10 14:09:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:09:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:09:46,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:09:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874084687] [2024-11-10 14:09:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874084687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:09:46,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:09:46,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:09:46,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483959197] [2024-11-10 14:09:46,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:09:46,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:09:46,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:09:46,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:09:46,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:09:46,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 311 [2024-11-10 14:09:46,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 351 transitions, 1192 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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) [2024-11-10 14:09:46,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:09:46,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 311 [2024-11-10 14:09:46,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:09:51,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][355], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 325#true, 275#L695true, 219#L699-2true, Black: 305#true, 303#true, 221#L699-1true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true]) [2024-11-10 14:09:51,016 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2024-11-10 14:09:51,016 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2024-11-10 14:09:51,016 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2024-11-10 14:09:51,017 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2024-11-10 14:09:51,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][264], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 325#true, 219#L699-2true, Black: 305#true, 303#true, 221#L699-1true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true, 258#L701true]) [2024-11-10 14:09:51,149 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2024-11-10 14:09:51,149 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2024-11-10 14:09:51,149 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2024-11-10 14:09:51,149 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2024-11-10 14:09:51,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][264], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 325#true, 219#L699-2true, 95#L697-4true, Black: 305#true, 303#true, 221#L699-1true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true]) [2024-11-10 14:09:51,176 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2024-11-10 14:09:51,176 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-10 14:09:51,176 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-11-10 14:09:51,176 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-10 14:09:51,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][328], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 100#L695-1true, 325#true, 54#L701true, 219#L699-2true, Black: 305#true, 303#true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true]) [2024-11-10 14:09:51,204 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2024-11-10 14:09:51,204 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2024-11-10 14:09:51,204 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2024-11-10 14:09:51,204 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-10 14:09:51,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][328], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 325#true, 275#L695true, 54#L701true, 219#L699-2true, Black: 305#true, 303#true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true]) [2024-11-10 14:09:51,282 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2024-11-10 14:09:51,282 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-10 14:09:51,282 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-11-10 14:09:51,283 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-10 14:09:51,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][264], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 325#true, 219#L699-2true, Black: 305#true, 143#L704-1true, 303#true, 221#L699-1true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true]) [2024-11-10 14:09:51,313 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2024-11-10 14:09:51,313 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-10 14:09:51,313 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-11-10 14:09:51,313 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2024-11-10 14:09:51,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][229], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 325#true, 54#L701true, 219#L699-2true, 95#L697-4true, Black: 305#true, 303#true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true]) [2024-11-10 14:09:51,357 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2024-11-10 14:09:51,357 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-11-10 14:09:51,357 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-11-10 14:09:51,357 INFO L297 olderBase$Statistics]: existing Event has 223 ancestors and is cut-off event [2024-11-10 14:09:51,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][264], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 325#true, 219#L699-2true, Black: 307#(= |#race~count~0| 0), 303#true, 221#L699-1true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true, 258#L701true]) [2024-11-10 14:09:51,868 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-11-10 14:09:51,868 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2024-11-10 14:09:51,868 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2024-11-10 14:09:51,868 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-10 14:09:51,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1115] L699-->L699-2: Formula: (= |v_#race~COND~0_6| 0) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_6|} AuxVars[] AssignedVars[#race~COND~0][264], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 325#true, 219#L699-2true, Black: 307#(= |#race~count~0| 0), 143#L704-1true, 303#true, 301#true, 221#L699-1true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true]) [2024-11-10 14:09:51,982 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-11-10 14:09:51,982 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-10 14:09:51,982 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-10 14:09:51,982 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-11-10 14:09:52,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][364], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 100#L695-1true, 320#true, 117#L701true, 54#L701true, Black: 307#(= |#race~count~0| 0), 303#true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 327#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet4#1| |#race~COND~0|), Black: 317#(= |#race~COND~0| 0)]) [2024-11-10 14:09:52,059 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2024-11-10 14:09:52,059 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-10 14:09:52,059 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2024-11-10 14:09:52,059 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-10 14:09:52,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][364], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 117#L701true, 275#L695true, 54#L701true, Black: 307#(= |#race~count~0| 0), 303#true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), 327#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet4#1| |#race~COND~0|), Black: 317#(= |#race~COND~0| 0)]) [2024-11-10 14:09:52,076 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2024-11-10 14:09:52,076 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-10 14:09:52,076 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2024-11-10 14:09:52,077 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-10 14:09:52,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][304], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 117#L701true, 325#true, 54#L701true, Black: 307#(= |#race~count~0| 0), 303#true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true, 258#L701true]) [2024-11-10 14:09:52,085 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2024-11-10 14:09:52,085 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-10 14:09:52,085 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-10 14:09:52,085 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-11-10 14:09:52,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][304], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 117#L701true, 325#true, 95#L697-4true, 54#L701true, Black: 307#(= |#race~count~0| 0), 303#true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 317#(= |#race~COND~0| 0)]) [2024-11-10 14:09:52,089 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2024-11-10 14:09:52,089 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-11-10 14:09:52,089 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-10 14:09:52,089 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-11-10 14:09:52,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L701-3-->L701: Formula: (and (= |v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#MTX~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#MTX~0.base_25|) |v_~#MTX~0.offset_25| 0)))) InVars {~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|} OutVars{~#MTX~0.base=|v_~#MTX~0.base_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, ~#MTX~0.offset=|v_~#MTX~0.offset_25|, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~ret8#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_Barrier2_#t~ret8#1][304], [Black: 322#(= |#race~count~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1|), 299#true, 6#L709-2true, 320#true, 117#L701true, 325#true, 54#L701true, Black: 307#(= |#race~count~0| 0), 143#L704-1true, 303#true, 301#true, Black: 312#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet3#1| |#race~count~0|), Black: 315#true]) [2024-11-10 14:09:52,098 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2024-11-10 14:09:52,099 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-10 14:09:52,099 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-10 14:09:52,099 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-10 14:09:52,103 INFO L124 PetriNetUnfolderBase]: 12975/44593 cut-off events. [2024-11-10 14:09:52,103 INFO L125 PetriNetUnfolderBase]: For 14691/16542 co-relation queries the response was YES. [2024-11-10 14:09:52,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83616 conditions, 44593 events. 12975/44593 cut-off events. For 14691/16542 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 612635 event pairs, 4768 based on Foata normal form. 98/38645 useless extension candidates. Maximal degree in co-relation 83302. Up to 14315 conditions per place. [2024-11-10 14:09:52,550 INFO L140 encePairwiseOnDemand]: 303/311 looper letters, 41 selfloop transitions, 12 changer transitions 0/371 dead transitions. [2024-11-10 14:09:52,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 371 transitions, 1364 flow [2024-11-10 14:09:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:09:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:09:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2024-11-10 14:09:52,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056806002143623 [2024-11-10 14:09:52,553 INFO L175 Difference]: Start difference. First operand has 293 places, 351 transitions, 1192 flow. Second operand 3 states and 845 transitions. [2024-11-10 14:09:52,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 371 transitions, 1364 flow [2024-11-10 14:09:52,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 371 transitions, 1308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:09:52,591 INFO L231 Difference]: Finished difference. Result has 295 places, 361 transitions, 1242 flow [2024-11-10 14:09:52,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1242, PETRI_PLACES=295, PETRI_TRANSITIONS=361} [2024-11-10 14:09:52,593 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -7 predicate places. [2024-11-10 14:09:52,594 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 361 transitions, 1242 flow [2024-11-10 14:09:52,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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) [2024-11-10 14:09:52,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:52,595 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:52,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:09:52,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-11-10 14:09:52,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:52,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1735690, now seen corresponding path program 1 times [2024-11-10 14:09:52,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:52,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928946868] [2024-11-10 14:09:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:09:52,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:09:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:09:52,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:09:52,674 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:09:52,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2024-11-10 14:09:52,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2024-11-10 14:09:52,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2024-11-10 14:09:52,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2024-11-10 14:09:52,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2024-11-10 14:09:52,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2024-11-10 14:09:52,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2024-11-10 14:09:52,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2024-11-10 14:09:52,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2024-11-10 14:09:52,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2024-11-10 14:09:52,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2024-11-10 14:09:52,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2024-11-10 14:09:52,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2024-11-10 14:09:52,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2024-11-10 14:09:52,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2024-11-10 14:09:52,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2024-11-10 14:09:52,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2024-11-10 14:09:52,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2024-11-10 14:09:52,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2024-11-10 14:09:52,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2024-11-10 14:09:52,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2024-11-10 14:09:52,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2024-11-10 14:09:52,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2024-11-10 14:09:52,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2024-11-10 14:09:52,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2024-11-10 14:09:52,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:09:52,683 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:09:52,684 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:09:52,684 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-10 14:09:52,725 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:09:52,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 365 transitions, 758 flow [2024-11-10 14:09:52,792 INFO L124 PetriNetUnfolderBase]: 25/411 cut-off events. [2024-11-10 14:09:52,792 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 14:09:52,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 411 events. 25/411 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 952 event pairs, 0 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 353. Up to 10 conditions per place. [2024-11-10 14:09:52,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 365 transitions, 758 flow [2024-11-10 14:09:52,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 353 places, 365 transitions, 758 flow [2024-11-10 14:09:52,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:09:52,800 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;@7f636b29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:09:52,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-10 14:09:52,814 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:09:52,815 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:09:52,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:09:52,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:09:52,815 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:09:52,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2024-11-10 14:09:52,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:09:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash -611906444, now seen corresponding path program 1 times [2024-11-10 14:09:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:09:52,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144332293] [2024-11-10 14:09:52,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:09:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:09:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:09:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:09:52,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:09:52,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144332293] [2024-11-10 14:09:52,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144332293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:09:52,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:09:52,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:09:52,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739018651] [2024-11-10 14:09:52,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:09:52,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:09:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:09:52,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:09:52,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:09:52,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 365 [2024-11-10 14:09:52,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 365 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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) [2024-11-10 14:09:52,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:09:52,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 365 [2024-11-10 14:09:52,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand