./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.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 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 16:43:25,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 16:43:25,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 16:43:25,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 16:43:25,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 16:43:25,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 16:43:25,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 16:43:25,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 16:43:25,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 16:43:25,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 16:43:25,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 16:43:25,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 16:43:25,772 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 16:43:25,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 16:43:25,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 16:43:25,774 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 16:43:25,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 16:43:25,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 16:43:25,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 16:43:25,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 16:43:25,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 16:43:25,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 16:43:25,776 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 16:43:25,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 16:43:25,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 16:43:25,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 16:43:25,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 16:43:25,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 16:43:25,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 16:43:25,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 16:43:25,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 16:43:25,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:43:25,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 16:43:25,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 16:43:25,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 16:43:25,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 16:43:25,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 16:43:25,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 16:43:25,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 16:43:25,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 16:43:25,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 16:43:25,785 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 -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2024-10-14 16:43:26,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 16:43:26,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 16:43:26,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 16:43:26,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 16:43:26,042 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 16:43:26,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-10-14 16:43:27,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 16:43:27,725 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 16:43:27,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-10-14 16:43:27,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531cc5b97/54afe88842704f56abb09b68d56691a9/FLAG7c0eea52a [2024-10-14 16:43:27,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531cc5b97/54afe88842704f56abb09b68d56691a9 [2024-10-14 16:43:27,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 16:43:27,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 16:43:27,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 16:43:27,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 16:43:27,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 16:43:27,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:43:27" (1/1) ... [2024-10-14 16:43:27,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744bf1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:27, skipping insertion in model container [2024-10-14 16:43:27,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:43:27" (1/1) ... [2024-10-14 16:43:27,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 16:43:28,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:43:28,240 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 16:43:28,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:43:28,365 INFO L204 MainTranslator]: Completed translation [2024-10-14 16:43:28,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28 WrapperNode [2024-10-14 16:43:28,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 16:43:28,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 16:43:28,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 16:43:28,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 16:43:28,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,447 INFO L138 Inliner]: procedures = 277, calls = 32, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 195 [2024-10-14 16:43:28,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 16:43:28,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 16:43:28,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 16:43:28,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 16:43:28,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 16:43:28,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 16:43:28,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 16:43:28,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 16:43:28,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (1/1) ... [2024-10-14 16:43:28,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:43:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:43:28,547 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-10-14 16:43:28,552 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-10-14 16:43:28,601 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-14 16:43:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-14 16:43:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-14 16:43:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-14 16:43:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 16:43:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 16:43:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 16:43:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 16:43:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 16:43:28,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 16:43:28,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 16:43:28,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 16:43:28,604 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 16:43:28,757 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 16:43:28,759 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 16:43:29,083 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 16:43:29,083 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 16:43:29,114 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 16:43:29,115 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 16:43:29,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:43:29 BoogieIcfgContainer [2024-10-14 16:43:29,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 16:43:29,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 16:43:29,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 16:43:29,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 16:43:29,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:43:27" (1/3) ... [2024-10-14 16:43:29,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743685ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:43:29, skipping insertion in model container [2024-10-14 16:43:29,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:43:28" (2/3) ... [2024-10-14 16:43:29,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743685ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:43:29, skipping insertion in model container [2024-10-14 16:43:29,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:43:29" (3/3) ... [2024-10-14 16:43:29,132 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2024-10-14 16:43:29,147 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 16:43:29,147 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-14 16:43:29,147 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 16:43:29,238 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 16:43:29,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 218 transitions, 450 flow [2024-10-14 16:43:29,393 INFO L124 PetriNetUnfolderBase]: 12/216 cut-off events. [2024-10-14 16:43:29,394 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 16:43:29,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 216 events. 12/216 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 535 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2024-10-14 16:43:29,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 218 transitions, 450 flow [2024-10-14 16:43:29,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 211 transitions, 431 flow [2024-10-14 16:43:29,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 16:43:29,440 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;@432e945c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 16:43:29,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-10-14 16:43:29,478 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 16:43:29,478 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2024-10-14 16:43:29,478 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 16:43:29,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:43:29,479 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] [2024-10-14 16:43:29,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-10-14 16:43:29,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:43:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1371275246, now seen corresponding path program 1 times [2024-10-14 16:43:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:43:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931982753] [2024-10-14 16:43:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:43:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:43:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:43:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:43:29,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:43:29,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931982753] [2024-10-14 16:43:29,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931982753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:43:29,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:43:29,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:43:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646621238] [2024-10-14 16:43:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:43:29,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:43:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:43:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:43:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:43:29,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 218 [2024-10-14 16:43:29,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 211 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-10-14 16:43:29,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:43:29,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 218 [2024-10-14 16:43:29,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:43:30,096 INFO L124 PetriNetUnfolderBase]: 59/826 cut-off events. [2024-10-14 16:43:30,096 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-14 16:43:30,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 826 events. 59/826 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4173 event pairs, 10 based on Foata normal form. 61/785 useless extension candidates. Maximal degree in co-relation 791. Up to 54 conditions per place. [2024-10-14 16:43:30,111 INFO L140 encePairwiseOnDemand]: 207/218 looper letters, 16 selfloop transitions, 3 changer transitions 0/206 dead transitions. [2024-10-14 16:43:30,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 462 flow [2024-10-14 16:43:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:43:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:43:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 625 transitions. [2024-10-14 16:43:30,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9556574923547401 [2024-10-14 16:43:30,134 INFO L175 Difference]: Start difference. First operand has 206 places, 211 transitions, 431 flow. Second operand 3 states and 625 transitions. [2024-10-14 16:43:30,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 462 flow [2024-10-14 16:43:30,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 206 transitions, 455 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 16:43:30,145 INFO L231 Difference]: Finished difference. Result has 201 places, 201 transitions, 426 flow [2024-10-14 16:43:30,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=201, PETRI_TRANSITIONS=201} [2024-10-14 16:43:30,153 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, -5 predicate places. [2024-10-14 16:43:30,154 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 201 transitions, 426 flow [2024-10-14 16:43:30,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-10-14 16:43:30,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:43:30,155 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] [2024-10-14 16:43:30,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 16:43:30,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-10-14 16:43:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:43:30,156 INFO L85 PathProgramCache]: Analyzing trace with hash -582975462, now seen corresponding path program 1 times [2024-10-14 16:43:30,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:43:30,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794953733] [2024-10-14 16:43:30,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:43:30,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:43:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:43:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:43:30,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:43:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794953733] [2024-10-14 16:43:30,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794953733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:43:30,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:43:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:43:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550753171] [2024-10-14 16:43:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:43:30,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:43:30,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:43:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:43:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:43:30,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 218 [2024-10-14 16:43:30,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 201 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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-10-14 16:43:30,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:43:30,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 218 [2024-10-14 16:43:30,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:43:30,922 INFO L124 PetriNetUnfolderBase]: 414/3755 cut-off events. [2024-10-14 16:43:30,923 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-10-14 16:43:30,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 3755 events. 414/3755 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 31588 event pairs, 106 based on Foata normal form. 0/3389 useless extension candidates. Maximal degree in co-relation 3845. Up to 583 conditions per place. [2024-10-14 16:43:30,946 INFO L140 encePairwiseOnDemand]: 198/218 looper letters, 33 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2024-10-14 16:43:30,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 221 transitions, 563 flow [2024-10-14 16:43:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:43:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:43:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2024-10-14 16:43:30,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113149847094801 [2024-10-14 16:43:30,950 INFO L175 Difference]: Start difference. First operand has 201 places, 201 transitions, 426 flow. Second operand 3 states and 596 transitions. [2024-10-14 16:43:30,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 221 transitions, 563 flow [2024-10-14 16:43:30,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 221 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 16:43:30,958 INFO L231 Difference]: Finished difference. Result has 203 places, 215 transitions, 544 flow [2024-10-14 16:43:30,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=203, PETRI_TRANSITIONS=215} [2024-10-14 16:43:30,960 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, -3 predicate places. [2024-10-14 16:43:30,961 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 215 transitions, 544 flow [2024-10-14 16:43:30,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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-10-14 16:43:30,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:43:30,962 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] [2024-10-14 16:43:30,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 16:43:30,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-10-14 16:43:30,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:43:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash 440452166, now seen corresponding path program 1 times [2024-10-14 16:43:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:43:30,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942489706] [2024-10-14 16:43:30,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:43:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:43:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:43:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:43:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:43:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942489706] [2024-10-14 16:43:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942489706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:43:31,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:43:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 16:43:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52171629] [2024-10-14 16:43:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:43:31,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 16:43:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:43:31,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 16:43:31,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:43:31,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 218 [2024-10-14 16:43:31,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 215 transitions, 544 flow. Second operand has 5 states, 5 states have (on average 188.2) internal successors, (941), 5 states have internal predecessors, (941), 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-10-14 16:43:31,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:43:31,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 218 [2024-10-14 16:43:31,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:43:32,193 INFO L124 PetriNetUnfolderBase]: 694/6675 cut-off events. [2024-10-14 16:43:32,194 INFO L125 PetriNetUnfolderBase]: For 257/259 co-relation queries the response was YES. [2024-10-14 16:43:32,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8650 conditions, 6675 events. 694/6675 cut-off events. For 257/259 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 67994 event pairs, 261 based on Foata normal form. 11/6055 useless extension candidates. Maximal degree in co-relation 8212. Up to 691 conditions per place. [2024-10-14 16:43:32,236 INFO L140 encePairwiseOnDemand]: 209/218 looper letters, 55 selfloop transitions, 13 changer transitions 0/261 dead transitions. [2024-10-14 16:43:32,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 261 transitions, 780 flow [2024-10-14 16:43:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:43:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 16:43:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1561 transitions. [2024-10-14 16:43:32,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8950688073394495 [2024-10-14 16:43:32,241 INFO L175 Difference]: Start difference. First operand has 203 places, 215 transitions, 544 flow. Second operand 8 states and 1561 transitions. [2024-10-14 16:43:32,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 261 transitions, 780 flow [2024-10-14 16:43:32,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 261 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 16:43:32,252 INFO L231 Difference]: Finished difference. Result has 214 places, 226 transitions, 614 flow [2024-10-14 16:43:32,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=614, PETRI_PLACES=214, PETRI_TRANSITIONS=226} [2024-10-14 16:43:32,253 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, 8 predicate places. [2024-10-14 16:43:32,253 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 226 transitions, 614 flow [2024-10-14 16:43:32,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.2) internal successors, (941), 5 states have internal predecessors, (941), 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-10-14 16:43:32,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:43:32,254 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] [2024-10-14 16:43:32,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 16:43:32,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-10-14 16:43:32,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:43:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash -585599259, now seen corresponding path program 1 times [2024-10-14 16:43:32,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:43:32,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995071208] [2024-10-14 16:43:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:43:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:43:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:43:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:43:32,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:43:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995071208] [2024-10-14 16:43:32,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995071208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:43:32,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:43:32,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 16:43:32,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962660172] [2024-10-14 16:43:32,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:43:32,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:43:32,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:43:32,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:43:32,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:43:32,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 218 [2024-10-14 16:43:32,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 226 transitions, 614 flow. Second operand has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 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-10-14 16:43:32,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:43:32,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 218 [2024-10-14 16:43:32,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:43:33,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][70], [Black: 221#true, 189#L995-4true, 243#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 10#L1022-4true, Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 123#L1013-2true, Black: 216#true, 226#true, 212#true]) [2024-10-14 16:43:33,325 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2024-10-14 16:43:33,326 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 16:43:33,326 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 16:43:33,326 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-10-14 16:43:33,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][70], [Black: 221#true, 189#L995-4true, 243#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 10#L1022-4true, Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 123#L1013-2true, Black: 218#(= |#race~flag~0| 0), 226#true, 212#true]) [2024-10-14 16:43:33,758 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-10-14 16:43:33,758 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 16:43:33,758 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-14 16:43:33,759 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-14 16:43:33,959 INFO L124 PetriNetUnfolderBase]: 922/6944 cut-off events. [2024-10-14 16:43:33,959 INFO L125 PetriNetUnfolderBase]: For 344/355 co-relation queries the response was YES. [2024-10-14 16:43:33,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9838 conditions, 6944 events. 922/6944 cut-off events. For 344/355 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 68386 event pairs, 387 based on Foata normal form. 3/6318 useless extension candidates. Maximal degree in co-relation 9201. Up to 1293 conditions per place. [2024-10-14 16:43:34,015 INFO L140 encePairwiseOnDemand]: 207/218 looper letters, 35 selfloop transitions, 22 changer transitions 0/259 dead transitions. [2024-10-14 16:43:34,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 259 transitions, 802 flow [2024-10-14 16:43:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:43:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 16:43:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1162 transitions. [2024-10-14 16:43:34,019 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8883792048929664 [2024-10-14 16:43:34,019 INFO L175 Difference]: Start difference. First operand has 214 places, 226 transitions, 614 flow. Second operand 6 states and 1162 transitions. [2024-10-14 16:43:34,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 259 transitions, 802 flow [2024-10-14 16:43:34,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 259 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 16:43:34,028 INFO L231 Difference]: Finished difference. Result has 224 places, 247 transitions, 764 flow [2024-10-14 16:43:34,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=224, PETRI_TRANSITIONS=247} [2024-10-14 16:43:34,029 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, 18 predicate places. [2024-10-14 16:43:34,029 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 247 transitions, 764 flow [2024-10-14 16:43:34,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 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-10-14 16:43:34,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:43:34,031 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] [2024-10-14 16:43:34,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 16:43:34,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-10-14 16:43:34,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:43:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash 945092110, now seen corresponding path program 1 times [2024-10-14 16:43:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:43:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098667636] [2024-10-14 16:43:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:43:34,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:43:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:43:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:43:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:43:34,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098667636] [2024-10-14 16:43:34,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098667636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:43:34,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:43:34,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:43:34,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296455719] [2024-10-14 16:43:34,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:43:34,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:43:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:43:34,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:43:34,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:43:34,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 218 [2024-10-14 16:43:34,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 247 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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-10-14 16:43:34,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:43:34,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 218 [2024-10-14 16:43:34,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:43:35,224 INFO L124 PetriNetUnfolderBase]: 821/6874 cut-off events. [2024-10-14 16:43:35,224 INFO L125 PetriNetUnfolderBase]: For 822/916 co-relation queries the response was YES. [2024-10-14 16:43:35,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10317 conditions, 6874 events. 821/6874 cut-off events. For 822/916 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 66528 event pairs, 300 based on Foata normal form. 18/6320 useless extension candidates. Maximal degree in co-relation 6307. Up to 1120 conditions per place. [2024-10-14 16:43:35,263 INFO L140 encePairwiseOnDemand]: 210/218 looper letters, 30 selfloop transitions, 11 changer transitions 0/259 dead transitions. [2024-10-14 16:43:35,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 259 transitions, 886 flow [2024-10-14 16:43:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:43:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:43:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2024-10-14 16:43:35,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9051987767584098 [2024-10-14 16:43:35,266 INFO L175 Difference]: Start difference. First operand has 224 places, 247 transitions, 764 flow. Second operand 3 states and 592 transitions. [2024-10-14 16:43:35,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 259 transitions, 886 flow [2024-10-14 16:43:35,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 259 transitions, 886 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 16:43:35,275 INFO L231 Difference]: Finished difference. Result has 228 places, 256 transitions, 860 flow [2024-10-14 16:43:35,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=228, PETRI_TRANSITIONS=256} [2024-10-14 16:43:35,276 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, 22 predicate places. [2024-10-14 16:43:35,276 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 256 transitions, 860 flow [2024-10-14 16:43:35,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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-10-14 16:43:35,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:43:35,277 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] [2024-10-14 16:43:35,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 16:43:35,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-10-14 16:43:35,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:43:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash -795355777, now seen corresponding path program 1 times [2024-10-14 16:43:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:43:35,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247441182] [2024-10-14 16:43:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:43:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:43:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:43:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:43:35,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:43:35,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247441182] [2024-10-14 16:43:35,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247441182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:43:35,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:43:35,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:43:35,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606749078] [2024-10-14 16:43:35,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:43:35,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:43:35,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:43:35,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:43:35,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:43:35,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 218 [2024-10-14 16:43:35,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 256 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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-10-14 16:43:35,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:43:35,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 218 [2024-10-14 16:43:35,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:43:35,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][70], [Black: 221#true, Black: 256#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 70#L998true, 243#true, 259#true, 254#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 10#L1022-4true, Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 123#L1013-2true, Black: 248#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 247#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 218#(= |#race~flag~0| 0), Black: 245#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 226#true, Black: 246#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 212#true]) [2024-10-14 16:43:35,996 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-10-14 16:43:35,996 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 16:43:35,996 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-10-14 16:43:35,996 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 16:43:35,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][70], [Black: 221#true, Black: 256#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 243#true, 259#true, 254#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 10#L1022-4true, Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 15#L998-3true, 123#L1013-2true, Black: 248#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 247#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 218#(= |#race~flag~0| 0), Black: 245#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 226#true, Black: 246#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 212#true]) [2024-10-14 16:43:35,997 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2024-10-14 16:43:35,997 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 16:43:35,997 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2024-10-14 16:43:35,997 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 16:43:35,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][70], [Black: 221#true, 72#L992-3true, Black: 256#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 243#true, 259#true, 254#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 10#L1022-4true, Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 123#L1013-2true, Black: 248#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 247#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 218#(= |#race~flag~0| 0), Black: 245#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 226#true, Black: 246#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 212#true]) [2024-10-14 16:43:35,997 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2024-10-14 16:43:35,997 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-10-14 16:43:35,997 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 16:43:35,997 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 16:43:35,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][190], [Black: 221#true, Black: 256#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 243#true, 254#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 125#L997-3true, 10#L1022-4true, Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 123#L1013-2true, Black: 248#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 247#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 218#(= |#race~flag~0| 0), Black: 245#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 226#true, Black: 246#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 212#true, 261#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|)]) [2024-10-14 16:43:35,997 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-10-14 16:43:35,997 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-14 16:43:35,998 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-10-14 16:43:35,998 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-14 16:43:35,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][190], [Black: 221#true, Black: 256#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 243#true, 254#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 10#L1022-4true, Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 140#L997-2true, 123#L1013-2true, Black: 248#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 247#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 218#(= |#race~flag~0| 0), Black: 245#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 226#true, Black: 246#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 212#true, 261#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|)]) [2024-10-14 16:43:35,998 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-10-14 16:43:35,998 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-14 16:43:35,999 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-10-14 16:43:35,999 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-14 16:43:36,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][70], [Black: 221#true, Black: 256#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 73#L997-1true, 243#true, 259#true, 254#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 10#L1022-4true, Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 123#L1013-2true, Black: 248#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 247#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 218#(= |#race~flag~0| 0), 226#true, Black: 245#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 246#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 212#true]) [2024-10-14 16:43:36,002 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-10-14 16:43:36,002 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-14 16:43:36,002 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 16:43:36,002 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-14 16:43:36,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][70], [Black: 221#true, Black: 256#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 243#true, 259#true, 254#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 96#L1023-1true, 123#L1013-2true, Black: 248#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 247#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 218#(= |#race~flag~0| 0), Black: 245#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 226#true, Black: 246#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 212#true]) [2024-10-14 16:43:36,004 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2024-10-14 16:43:36,004 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-14 16:43:36,004 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 16:43:36,004 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 16:43:36,036 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([617] L1008-3-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][70], [Black: 221#true, Black: 256#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 73#L997-1true, 243#true, 259#true, 254#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 10#L1022-4true, Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), 123#L1013-2true, Black: 248#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 247#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 218#(= |#race~flag~0| 0), Black: 245#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 226#true, Black: 246#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 212#true]) [2024-10-14 16:43:36,036 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-10-14 16:43:36,037 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-14 16:43:36,037 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-10-14 16:43:36,037 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 16:43:36,037 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-14 16:43:36,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([536] L960-->L960-1: Formula: (= |v_#race~top~0_1| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_1|} AuxVars[] AssignedVars[#race~top~0][99], [Black: 221#true, Black: 256#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 8#L960-1true, 16#L952-6true, 243#true, 259#true, 254#true, Black: 236#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 229#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 10#L1022-4true, Black: 234#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 228#(= ~top~0 0), Black: 232#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 248#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 247#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 218#(= |#race~flag~0| 0), Black: 245#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 226#true, Black: 246#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 212#true]) [2024-10-14 16:43:36,115 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2024-10-14 16:43:36,115 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-10-14 16:43:36,115 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 16:43:36,115 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 16:43:36,266 INFO L124 PetriNetUnfolderBase]: 816/6988 cut-off events. [2024-10-14 16:43:36,266 INFO L125 PetriNetUnfolderBase]: For 990/1031 co-relation queries the response was YES. [2024-10-14 16:43:36,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10598 conditions, 6988 events. 816/6988 cut-off events. For 990/1031 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 68861 event pairs, 217 based on Foata normal form. 10/6447 useless extension candidates. Maximal degree in co-relation 6239. Up to 685 conditions per place. [2024-10-14 16:43:36,310 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 16 selfloop transitions, 6 changer transitions 0/263 dead transitions. [2024-10-14 16:43:36,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 263 transitions, 924 flow [2024-10-14 16:43:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:43:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:43:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 605 transitions. [2024-10-14 16:43:36,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9250764525993884 [2024-10-14 16:43:36,312 INFO L175 Difference]: Start difference. First operand has 228 places, 256 transitions, 860 flow. Second operand 3 states and 605 transitions. [2024-10-14 16:43:36,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 263 transitions, 924 flow [2024-10-14 16:43:36,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 263 transitions, 902 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 16:43:36,328 INFO L231 Difference]: Finished difference. Result has 230 places, 260 transitions, 884 flow [2024-10-14 16:43:36,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=230, PETRI_TRANSITIONS=260} [2024-10-14 16:43:36,329 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, 24 predicate places. [2024-10-14 16:43:36,329 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 260 transitions, 884 flow [2024-10-14 16:43:36,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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-10-14 16:43:36,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:43:36,330 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] [2024-10-14 16:43:36,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 16:43:36,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-10-14 16:43:36,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:43:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash 45886063, now seen corresponding path program 1 times [2024-10-14 16:43:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:43:36,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864440287] [2024-10-14 16:43:36,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:43:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:43:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:43:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:43:36,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:43:36,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864440287] [2024-10-14 16:43:36,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864440287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:43:36,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:43:36,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 16:43:36,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966826309] [2024-10-14 16:43:36,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:43:36,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:43:36,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:43:36,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:43:36,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:43:36,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 218 [2024-10-14 16:43:36,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 260 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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-10-14 16:43:36,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:43:36,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 218 [2024-10-14 16:43:36,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:43:36,658 INFO L124 PetriNetUnfolderBase]: 64/1301 cut-off events. [2024-10-14 16:43:36,658 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-10-14 16:43:36,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 1301 events. 64/1301 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6967 event pairs, 9 based on Foata normal form. 24/1257 useless extension candidates. Maximal degree in co-relation 1779. Up to 86 conditions per place. [2024-10-14 16:43:36,665 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 7 selfloop transitions, 4 changer transitions 0/202 dead transitions. [2024-10-14 16:43:36,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 202 transitions, 603 flow [2024-10-14 16:43:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:43:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:43:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2024-10-14 16:43:36,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9327217125382263 [2024-10-14 16:43:36,668 INFO L175 Difference]: Start difference. First operand has 230 places, 260 transitions, 884 flow. Second operand 3 states and 610 transitions. [2024-10-14 16:43:36,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 202 transitions, 603 flow [2024-10-14 16:43:36,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 513 flow, removed 27 selfloop flow, removed 17 redundant places. [2024-10-14 16:43:36,675 INFO L231 Difference]: Finished difference. Result has 204 places, 200 transitions, 492 flow [2024-10-14 16:43:36,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=204, PETRI_TRANSITIONS=200} [2024-10-14 16:43:36,676 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, -2 predicate places. [2024-10-14 16:43:36,676 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 200 transitions, 492 flow [2024-10-14 16:43:36,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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-10-14 16:43:36,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:43:36,677 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] [2024-10-14 16:43:36,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 16:43:36,678 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-10-14 16:43:36,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:43:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash 572189300, now seen corresponding path program 1 times [2024-10-14 16:43:36,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:43:36,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846559772] [2024-10-14 16:43:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:43:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:43:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:43:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:43:36,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:43:36,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846559772] [2024-10-14 16:43:36,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846559772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:43:36,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:43:36,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:43:36,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897664954] [2024-10-14 16:43:36,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:43:36,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:43:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:43:36,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:43:36,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:43:36,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 218 [2024-10-14 16:43:36,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 200 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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-10-14 16:43:36,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:43:36,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 218 [2024-10-14 16:43:36,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:43:36,929 INFO L124 PetriNetUnfolderBase]: 78/1237 cut-off events. [2024-10-14 16:43:36,929 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2024-10-14 16:43:36,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 1237 events. 78/1237 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6703 event pairs, 38 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 1023. Up to 171 conditions per place. [2024-10-14 16:43:36,934 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 21 selfloop transitions, 2 changer transitions 5/200 dead transitions. [2024-10-14 16:43:36,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 200 transitions, 539 flow [2024-10-14 16:43:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:43:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:43:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2024-10-14 16:43:36,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8914373088685015 [2024-10-14 16:43:36,936 INFO L175 Difference]: Start difference. First operand has 204 places, 200 transitions, 492 flow. Second operand 3 states and 583 transitions. [2024-10-14 16:43:36,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 200 transitions, 539 flow [2024-10-14 16:43:36,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 200 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 16:43:36,941 INFO L231 Difference]: Finished difference. Result has 204 places, 194 transitions, 480 flow [2024-10-14 16:43:36,941 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=204, PETRI_TRANSITIONS=194} [2024-10-14 16:43:36,942 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, -2 predicate places. [2024-10-14 16:43:36,942 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 194 transitions, 480 flow [2024-10-14 16:43:36,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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-10-14 16:43:36,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:43:36,943 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] [2024-10-14 16:43:36,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 16:43:36,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-10-14 16:43:36,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:43:36,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1319351042, now seen corresponding path program 1 times [2024-10-14 16:43:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:43:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905639366] [2024-10-14 16:43:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:43:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:43:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:43:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:43:37,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:43:37,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905639366] [2024-10-14 16:43:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905639366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:43:37,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:43:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 16:43:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872547349] [2024-10-14 16:43:37,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:43:37,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:43:37,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:43:37,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:43:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:43:37,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 218 [2024-10-14 16:43:37,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 194 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 188.83333333333334) internal successors, (1133), 6 states have internal predecessors, (1133), 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-10-14 16:43:37,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:43:37,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 218 [2024-10-14 16:43:37,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:43:37,757 INFO L124 PetriNetUnfolderBase]: 92/1251 cut-off events. [2024-10-14 16:43:37,758 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-10-14 16:43:37,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 1251 events. 92/1251 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6838 event pairs, 47 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 1581. Up to 190 conditions per place. [2024-10-14 16:43:37,763 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 0 selfloop transitions, 0 changer transitions 197/197 dead transitions. [2024-10-14 16:43:37,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 197 transitions, 540 flow [2024-10-14 16:43:37,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:43:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 16:43:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1142 transitions. [2024-10-14 16:43:37,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8730886850152905 [2024-10-14 16:43:37,766 INFO L175 Difference]: Start difference. First operand has 204 places, 194 transitions, 480 flow. Second operand 6 states and 1142 transitions. [2024-10-14 16:43:37,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 197 transitions, 540 flow [2024-10-14 16:43:37,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 197 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 16:43:37,770 INFO L231 Difference]: Finished difference. Result has 201 places, 0 transitions, 0 flow [2024-10-14 16:43:37,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=201, PETRI_TRANSITIONS=0} [2024-10-14 16:43:37,771 INFO L277 CegarLoopForPetriNet]: 206 programPoint places, -5 predicate places. [2024-10-14 16:43:37,771 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 0 transitions, 0 flow [2024-10-14 16:43:37,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.83333333333334) internal successors, (1133), 6 states have internal predecessors, (1133), 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-10-14 16:43:37,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2024-10-14 16:43:37,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 26 remaining) [2024-10-14 16:43:37,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2024-10-14 16:43:37,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2024-10-14 16:43:37,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2024-10-14 16:43:37,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2024-10-14 16:43:37,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2024-10-14 16:43:37,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2024-10-14 16:43:37,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2024-10-14 16:43:37,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2024-10-14 16:43:37,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2024-10-14 16:43:37,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2024-10-14 16:43:37,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2024-10-14 16:43:37,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2024-10-14 16:43:37,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2024-10-14 16:43:37,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2024-10-14 16:43:37,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2024-10-14 16:43:37,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2024-10-14 16:43:37,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2024-10-14 16:43:37,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2024-10-14 16:43:37,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2024-10-14 16:43:37,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2024-10-14 16:43:37,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2024-10-14 16:43:37,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2024-10-14 16:43:37,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2024-10-14 16:43:37,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2024-10-14 16:43:37,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 16:43:37,780 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:43:37,786 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 16:43:37,786 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 16:43:37,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:43:37 BasicIcfg [2024-10-14 16:43:37,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 16:43:37,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 16:43:37,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 16:43:37,797 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 16:43:37,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:43:29" (3/4) ... [2024-10-14 16:43:37,802 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 16:43:37,806 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2024-10-14 16:43:37,806 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2024-10-14 16:43:37,809 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-14 16:43:37,809 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 16:43:37,810 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 16:43:37,810 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 16:43:37,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 16:43:37,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 16:43:37,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 16:43:37,888 INFO L158 Benchmark]: Toolchain (without parser) took 10128.58ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 838.9MB). Free memory was 110.6MB in the beginning and 289.4MB in the end (delta: -178.8MB). Peak memory consumption was 659.8MB. Max. memory is 16.1GB. [2024-10-14 16:43:37,888 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 16:43:37,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.26ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 116.4MB in the end (delta: -5.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 16:43:37,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.09ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 113.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 16:43:37,889 INFO L158 Benchmark]: Boogie Preprocessor took 57.10ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 16:43:37,890 INFO L158 Benchmark]: RCFGBuilder took 606.04ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 88.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 16:43:37,890 INFO L158 Benchmark]: TraceAbstraction took 8678.13ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 838.9MB). Free memory was 87.0MB in the beginning and 293.6MB in the end (delta: -206.6MB). Peak memory consumption was 633.1MB. Max. memory is 16.1GB. [2024-10-14 16:43:37,890 INFO L158 Benchmark]: Witness Printer took 91.46ms. Allocated memory is still 1.0GB. Free memory was 293.6MB in the beginning and 289.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 16:43:37,892 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.26ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 116.4MB in the end (delta: -5.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.09ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 113.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.10ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 606.04ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 88.3MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8678.13ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 838.9MB). Free memory was 87.0MB in the beginning and 293.6MB in the end (delta: -206.6MB). Peak memory consumption was 633.1MB. Max. memory is 16.1GB. * Witness Printer took 91.46ms. Allocated memory is still 1.0GB. Free memory was 293.6MB in the beginning and 289.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 952]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 997]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 967]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 944]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 944]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1008]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 952]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 948]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 948]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 952]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 982]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 374 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 638 IncrementalHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 82 mSDtfsCounter, 638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=884occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 738 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 16:43:37,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE