./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:11:43,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:11:43,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:11:43,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:11:43,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:11:43,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:11:43,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:11:43,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:11:43,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:11:43,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:11:43,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:11:43,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:11:43,647 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:11:43,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:11:43,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:11:43,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:11:43,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:11:43,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:11:43,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:11:43,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:11:43,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:11:43,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:11:43,651 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:11:43,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:11:43,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:11:43,652 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:11:43,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:11:43,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:11:43,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:11:43,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:11:43,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:11:43,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:11:43,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:11:43,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:11:43,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:11:43,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:11:43,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:11:43,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:11:43,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:11:43,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:11:43,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:11:43,657 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2024-11-16 23:11:43,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:11:43,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:11:43,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:11:43,931 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:11:43,932 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:11:43,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2024-11-16 23:11:45,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:11:45,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:11:45,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-11-16 23:11:45,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fdcfa6f0/e9976c2e989d4b53a1ed3d6a99ba091d/FLAG11427a8f9 [2024-11-16 23:11:45,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fdcfa6f0/e9976c2e989d4b53a1ed3d6a99ba091d [2024-11-16 23:11:45,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:11:45,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:11:45,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:11:45,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:11:45,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:11:45,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:11:45" (1/1) ... [2024-11-16 23:11:45,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edec15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:45, skipping insertion in model container [2024-11-16 23:11:45,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:11:45" (1/1) ... [2024-11-16 23:11:45,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:11:46,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:11:46,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:11:46,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:11:46,237 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:11:46,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46 WrapperNode [2024-11-16 23:11:46,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:11:46,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:11:46,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:11:46,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:11:46,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,291 INFO L138 Inliner]: procedures = 277, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 197 [2024-11-16 23:11:46,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:11:46,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:11:46,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:11:46,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:11:46,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:11:46,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:11:46,342 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:11:46,342 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:11:46,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (1/1) ... [2024-11-16 23:11:46,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:11:46,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:11:46,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:11:46,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:11:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-16 23:11:46,415 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-16 23:11:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-16 23:11:46,415 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-16 23:11:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:11:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:11:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:11:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:11:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:11:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:11:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:11:46,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:11:46,419 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:11:46,553 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:11:46,555 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:11:46,893 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2024-11-16 23:11:46,893 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem41#1; [2024-11-16 23:11:46,893 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret40#1; [2024-11-16 23:11:46,895 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:11:46,895 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:11:46,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:11:46,929 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:11:46,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:11:46 BoogieIcfgContainer [2024-11-16 23:11:46,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:11:46,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:11:46,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:11:46,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:11:46,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:11:45" (1/3) ... [2024-11-16 23:11:46,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cceb2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:11:46, skipping insertion in model container [2024-11-16 23:11:46,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:11:46" (2/3) ... [2024-11-16 23:11:46,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cceb2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:11:46, skipping insertion in model container [2024-11-16 23:11:46,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:11:46" (3/3) ... [2024-11-16 23:11:46,936 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-11-16 23:11:46,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:11:46,950 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-16 23:11:46,950 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:11:47,057 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:11:47,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 224 transitions, 462 flow [2024-11-16 23:11:47,184 INFO L124 PetriNetUnfolderBase]: 12/222 cut-off events. [2024-11-16 23:11:47,184 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:11:47,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 222 events. 12/222 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 540 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 187. Up to 3 conditions per place. [2024-11-16 23:11:47,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 224 transitions, 462 flow [2024-11-16 23:11:47,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 212 places, 217 transitions, 443 flow [2024-11-16 23:11:47,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:11:47,223 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;@a7250ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:11:47,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-16 23:11:47,242 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:11:47,242 INFO L124 PetriNetUnfolderBase]: 2/70 cut-off events. [2024-11-16 23:11:47,242 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:11:47,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:47,243 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] [2024-11-16 23:11:47,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-16 23:11:47,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1806671710, now seen corresponding path program 1 times [2024-11-16 23:11:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:47,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875274143] [2024-11-16 23:11:47,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:47,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:11:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:47,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875274143] [2024-11-16 23:11:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875274143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:11:47,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:11:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:11:47,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936726551] [2024-11-16 23:11:47,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:11:47,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:11:47,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:47,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:11:47,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:11:47,615 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 224 [2024-11-16 23:11:47,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 217 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:47,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:47,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 224 [2024-11-16 23:11:47,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:47,835 INFO L124 PetriNetUnfolderBase]: 59/843 cut-off events. [2024-11-16 23:11:47,835 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-16 23:11:47,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 843 events. 59/843 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4256 event pairs, 10 based on Foata normal form. 61/802 useless extension candidates. Maximal degree in co-relation 803. Up to 54 conditions per place. [2024-11-16 23:11:47,847 INFO L140 encePairwiseOnDemand]: 213/224 looper letters, 16 selfloop transitions, 3 changer transitions 0/212 dead transitions. [2024-11-16 23:11:47,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 212 transitions, 474 flow [2024-11-16 23:11:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:11:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:11:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 643 transitions. [2024-11-16 23:11:47,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9568452380952381 [2024-11-16 23:11:47,865 INFO L175 Difference]: Start difference. First operand has 212 places, 217 transitions, 443 flow. Second operand 3 states and 643 transitions. [2024-11-16 23:11:47,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 212 transitions, 474 flow [2024-11-16 23:11:47,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 212 transitions, 467 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 23:11:47,874 INFO L231 Difference]: Finished difference. Result has 207 places, 207 transitions, 438 flow [2024-11-16 23:11:47,876 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=207, PETRI_TRANSITIONS=207} [2024-11-16 23:11:47,882 INFO L277 CegarLoopForPetriNet]: 212 programPoint places, -5 predicate places. [2024-11-16 23:11:47,882 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 207 transitions, 438 flow [2024-11-16 23:11:47,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:47,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:47,884 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] [2024-11-16 23:11:47,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:11:47,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-16 23:11:47,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1862111785, now seen corresponding path program 1 times [2024-11-16 23:11:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:47,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725146321] [2024-11-16 23:11:47,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:11:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:47,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725146321] [2024-11-16 23:11:47,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725146321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:11:47,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:11:47,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:11:47,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061816636] [2024-11-16 23:11:47,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:11:47,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:11:47,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:47,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:11:47,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:11:48,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 224 [2024-11-16 23:11:48,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 207 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:48,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:48,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 224 [2024-11-16 23:11:48,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:48,649 INFO L124 PetriNetUnfolderBase]: 414/3811 cut-off events. [2024-11-16 23:11:48,649 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-16 23:11:48,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4718 conditions, 3811 events. 414/3811 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 32113 event pairs, 106 based on Foata normal form. 0/3446 useless extension candidates. Maximal degree in co-relation 3882. Up to 583 conditions per place. [2024-11-16 23:11:48,670 INFO L140 encePairwiseOnDemand]: 204/224 looper letters, 33 selfloop transitions, 14 changer transitions 0/227 dead transitions. [2024-11-16 23:11:48,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 227 transitions, 575 flow [2024-11-16 23:11:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:11:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:11:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2024-11-16 23:11:48,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9136904761904762 [2024-11-16 23:11:48,676 INFO L175 Difference]: Start difference. First operand has 207 places, 207 transitions, 438 flow. Second operand 3 states and 614 transitions. [2024-11-16 23:11:48,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 227 transitions, 575 flow [2024-11-16 23:11:48,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 227 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:11:48,684 INFO L231 Difference]: Finished difference. Result has 209 places, 221 transitions, 556 flow [2024-11-16 23:11:48,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=209, PETRI_TRANSITIONS=221} [2024-11-16 23:11:48,685 INFO L277 CegarLoopForPetriNet]: 212 programPoint places, -3 predicate places. [2024-11-16 23:11:48,685 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 221 transitions, 556 flow [2024-11-16 23:11:48,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:48,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:48,686 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] [2024-11-16 23:11:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:11:48,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-16 23:11:48,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:48,690 INFO L85 PathProgramCache]: Analyzing trace with hash 434855770, now seen corresponding path program 1 times [2024-11-16 23:11:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:48,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652353992] [2024-11-16 23:11:48,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:48,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:11:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652353992] [2024-11-16 23:11:48,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652353992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:11:48,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:11:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:11:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491509411] [2024-11-16 23:11:48,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:11:48,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:11:48,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:48,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:11:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:11:48,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 224 [2024-11-16 23:11:48,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 221 transitions, 556 flow. Second operand has 5 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:48,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:48,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 224 [2024-11-16 23:11:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:49,977 INFO L124 PetriNetUnfolderBase]: 694/6762 cut-off events. [2024-11-16 23:11:49,977 INFO L125 PetriNetUnfolderBase]: For 257/259 co-relation queries the response was YES. [2024-11-16 23:11:49,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8737 conditions, 6762 events. 694/6762 cut-off events. For 257/259 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 68707 event pairs, 261 based on Foata normal form. 11/6136 useless extension candidates. Maximal degree in co-relation 8288. Up to 691 conditions per place. [2024-11-16 23:11:50,011 INFO L140 encePairwiseOnDemand]: 215/224 looper letters, 55 selfloop transitions, 13 changer transitions 0/267 dead transitions. [2024-11-16 23:11:50,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 267 transitions, 792 flow [2024-11-16 23:11:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 23:11:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 23:11:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1609 transitions. [2024-11-16 23:11:50,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8978794642857143 [2024-11-16 23:11:50,016 INFO L175 Difference]: Start difference. First operand has 209 places, 221 transitions, 556 flow. Second operand 8 states and 1609 transitions. [2024-11-16 23:11:50,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 267 transitions, 792 flow [2024-11-16 23:11:50,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 267 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:11:50,027 INFO L231 Difference]: Finished difference. Result has 220 places, 232 transitions, 626 flow [2024-11-16 23:11:50,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=626, PETRI_PLACES=220, PETRI_TRANSITIONS=232} [2024-11-16 23:11:50,030 INFO L277 CegarLoopForPetriNet]: 212 programPoint places, 8 predicate places. [2024-11-16 23:11:50,030 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 232 transitions, 626 flow [2024-11-16 23:11:50,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:50,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:50,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] [2024-11-16 23:11:50,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:11:50,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-16 23:11:50,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:50,033 INFO L85 PathProgramCache]: Analyzing trace with hash -791315301, now seen corresponding path program 1 times [2024-11-16 23:11:50,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:50,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909788520] [2024-11-16 23:11:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:11:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909788520] [2024-11-16 23:11:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909788520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:11:50,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:11:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:11:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954636056] [2024-11-16 23:11:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:11:50,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:11:50,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:50,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:11:50,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:11:50,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 224 [2024-11-16 23:11:50,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 232 transitions, 626 flow. Second operand has 6 states, 6 states have (on average 191.83333333333334) internal successors, (1151), 6 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:50,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:50,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 224 [2024-11-16 23:11:50,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:51,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1015-3-->L1015: 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][76], [220#true, Black: 222#true, 29#L1024-1true, Black: 227#true, 87#L997-4true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, 232#true]) [2024-11-16 23:11:51,291 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-16 23:11:51,291 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-16 23:11:51,291 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-16 23:11:51,291 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-16 23:11:51,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1015-3-->L1015: 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][76], [Black: 224#(= |#race~flag~0| 0), 220#true, Black: 227#true, 29#L1024-1true, 87#L997-4true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, 232#true]) [2024-11-16 23:11:51,625 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-11-16 23:11:51,625 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-16 23:11:51,625 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-16 23:11:51,626 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-16 23:11:51,781 INFO L124 PetriNetUnfolderBase]: 922/7030 cut-off events. [2024-11-16 23:11:51,781 INFO L125 PetriNetUnfolderBase]: For 343/353 co-relation queries the response was YES. [2024-11-16 23:11:51,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9924 conditions, 7030 events. 922/7030 cut-off events. For 343/353 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 69289 event pairs, 387 based on Foata normal form. 3/6402 useless extension candidates. Maximal degree in co-relation 9274. Up to 1293 conditions per place. [2024-11-16 23:11:51,830 INFO L140 encePairwiseOnDemand]: 213/224 looper letters, 35 selfloop transitions, 22 changer transitions 0/265 dead transitions. [2024-11-16 23:11:51,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 265 transitions, 814 flow [2024-11-16 23:11:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:11:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:11:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1198 transitions. [2024-11-16 23:11:51,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8913690476190477 [2024-11-16 23:11:51,835 INFO L175 Difference]: Start difference. First operand has 220 places, 232 transitions, 626 flow. Second operand 6 states and 1198 transitions. [2024-11-16 23:11:51,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 265 transitions, 814 flow [2024-11-16 23:11:51,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 265 transitions, 814 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:11:51,843 INFO L231 Difference]: Finished difference. Result has 230 places, 253 transitions, 776 flow [2024-11-16 23:11:51,844 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=230, PETRI_TRANSITIONS=253} [2024-11-16 23:11:51,845 INFO L277 CegarLoopForPetriNet]: 212 programPoint places, 18 predicate places. [2024-11-16 23:11:51,846 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 253 transitions, 776 flow [2024-11-16 23:11:51,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.83333333333334) internal successors, (1151), 6 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:51,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:51,847 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] [2024-11-16 23:11:51,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:11:51,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-16 23:11:51,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1495342308, now seen corresponding path program 1 times [2024-11-16 23:11:51,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:51,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718287085] [2024-11-16 23:11:51,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:51,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:11:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718287085] [2024-11-16 23:11:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718287085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:11:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:11:51,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:11:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040436327] [2024-11-16 23:11:51,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:11:51,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:11:51,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:11:51,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:11:51,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 224 [2024-11-16 23:11:51,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 253 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:51,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:51,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 224 [2024-11-16 23:11:51,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:52,854 INFO L124 PetriNetUnfolderBase]: 821/6973 cut-off events. [2024-11-16 23:11:52,854 INFO L125 PetriNetUnfolderBase]: For 818/910 co-relation queries the response was YES. [2024-11-16 23:11:52,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10416 conditions, 6973 events. 821/6973 cut-off events. For 818/910 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 67453 event pairs, 298 based on Foata normal form. 18/6420 useless extension candidates. Maximal degree in co-relation 6358. Up to 1120 conditions per place. [2024-11-16 23:11:52,893 INFO L140 encePairwiseOnDemand]: 216/224 looper letters, 30 selfloop transitions, 11 changer transitions 0/265 dead transitions. [2024-11-16 23:11:52,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 265 transitions, 898 flow [2024-11-16 23:11:52,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:11:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:11:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2024-11-16 23:11:52,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9077380952380952 [2024-11-16 23:11:52,896 INFO L175 Difference]: Start difference. First operand has 230 places, 253 transitions, 776 flow. Second operand 3 states and 610 transitions. [2024-11-16 23:11:52,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 265 transitions, 898 flow [2024-11-16 23:11:52,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 265 transitions, 898 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:11:52,907 INFO L231 Difference]: Finished difference. Result has 234 places, 262 transitions, 872 flow [2024-11-16 23:11:52,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=234, PETRI_TRANSITIONS=262} [2024-11-16 23:11:52,909 INFO L277 CegarLoopForPetriNet]: 212 programPoint places, 22 predicate places. [2024-11-16 23:11:52,910 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 262 transitions, 872 flow [2024-11-16 23:11:52,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:52,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:52,911 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] [2024-11-16 23:11:52,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:11:52,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-16 23:11:52,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:52,912 INFO L85 PathProgramCache]: Analyzing trace with hash -306009196, now seen corresponding path program 1 times [2024-11-16 23:11:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922783752] [2024-11-16 23:11:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:11:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922783752] [2024-11-16 23:11:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922783752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:11:52,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:11:52,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:11:52,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452613271] [2024-11-16 23:11:52,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:11:52,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:11:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:52,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:11:52,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:11:52,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 224 [2024-11-16 23:11:52,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 262 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:52,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:52,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 224 [2024-11-16 23:11:52,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:53,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1015-3-->L1015: 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][76], [Black: 251#(= (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: 224#(= |#race~flag~0| 0), 220#true, Black: 254#(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: 252#(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|)), 29#L1024-1true, Black: 227#true, Black: 262#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 260#true, 265#true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, 184#L1000-3true, Black: 253#(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|)), 232#true]) [2024-11-16 23:11:53,774 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2024-11-16 23:11:53,774 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-16 23:11:53,775 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-11-16 23:11:53,775 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-16 23:11:53,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1015-3-->L1015: 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][76], [Black: 251#(= (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: 224#(= |#race~flag~0| 0), 220#true, Black: 254#(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: 252#(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|)), 29#L1024-1true, Black: 227#true, Black: 262#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 157#L994true, 260#true, 265#true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, Black: 253#(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|)), 232#true]) [2024-11-16 23:11:53,775 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2024-11-16 23:11:53,775 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-16 23:11:53,775 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-16 23:11:53,776 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-16 23:11:53,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1015-3-->L1015: 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][76], [Black: 251#(= (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: 224#(= |#race~flag~0| 0), 220#true, Black: 254#(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|)), 9#L1000true, Black: 252#(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|)), 29#L1024-1true, Black: 227#true, Black: 262#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 260#true, 265#true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, Black: 253#(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|)), 232#true]) [2024-11-16 23:11:53,776 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2024-11-16 23:11:53,776 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-16 23:11:53,777 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-16 23:11:53,777 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-16 23:11:53,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1015-3-->L1015: 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][196], [Black: 251#(= (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: 224#(= |#race~flag~0| 0), 220#true, Black: 254#(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: 252#(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|)), 29#L1024-1true, Black: 227#true, Black: 262#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 66#L999true, 267#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), 260#true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, Black: 253#(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|)), 232#true]) [2024-11-16 23:11:53,777 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2024-11-16 23:11:53,777 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-11-16 23:11:53,778 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-16 23:11:53,778 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-16 23:11:53,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1015-3-->L1015: 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][196], [Black: 251#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), 72#L999-1true, Black: 224#(= |#race~flag~0| 0), 220#true, Black: 254#(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: 252#(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|)), 29#L1024-1true, Black: 227#true, Black: 262#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 267#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), 260#true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, Black: 253#(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|)), 232#true]) [2024-11-16 23:11:53,778 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-11-16 23:11:53,778 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-16 23:11:53,778 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-16 23:11:53,779 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2024-11-16 23:11:53,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1015-3-->L1015: 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][76], [Black: 251#(= (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: 224#(= |#race~flag~0| 0), 220#true, Black: 254#(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: 252#(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|)), Black: 227#true, 29#L1024-1true, Black: 262#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 190#L999-2true, 265#true, 260#true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, Black: 253#(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|)), 232#true]) [2024-11-16 23:11:53,783 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-11-16 23:11:53,783 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2024-11-16 23:11:53,783 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-16 23:11:53,784 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-11-16 23:11:53,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1015-3-->L1015: 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][76], [Black: 251#(= (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: 224#(= |#race~flag~0| 0), 220#true, Black: 254#(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: 252#(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|)), Black: 227#true, 164#L1026true, Black: 262#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 265#true, 260#true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, Black: 253#(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|)), 232#true]) [2024-11-16 23:11:53,806 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2024-11-16 23:11:53,806 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-16 23:11:53,807 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-16 23:11:53,807 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-16 23:11:53,831 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([584] L1015-3-->L1015: 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][76], [Black: 251#(= (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: 224#(= |#race~flag~0| 0), 220#true, Black: 254#(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: 252#(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|)), 29#L1024-1true, Black: 227#true, 190#L999-2true, Black: 262#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 265#true, 260#true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 143#L1015true, Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, Black: 253#(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|)), 232#true]) [2024-11-16 23:11:53,831 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-11-16 23:11:53,831 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2024-11-16 23:11:53,831 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-16 23:11:53,832 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-11-16 23:11:53,832 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2024-11-16 23:11:53,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([502] L962-2-->L962-1: Formula: (= |v_#race~top~0_12| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_12|} AuxVars[] AssignedVars[#race~top~0][107], [Black: 251#(= (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: 224#(= |#race~flag~0| 0), 220#true, Black: 254#(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: 252#(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|)), 29#L1024-1true, Black: 227#true, Black: 262#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 260#true, 265#true, 177#L954-1true, Black: 235#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 240#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 242#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 234#(= ~top~0 0), 249#true, 45#L962-1true, Black: 253#(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|)), 232#true]) [2024-11-16 23:11:53,945 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2024-11-16 23:11:53,946 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-11-16 23:11:53,946 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-16 23:11:53,946 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-16 23:11:54,054 INFO L124 PetriNetUnfolderBase]: 816/7094 cut-off events. [2024-11-16 23:11:54,055 INFO L125 PetriNetUnfolderBase]: For 982/1020 co-relation queries the response was YES. [2024-11-16 23:11:54,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10704 conditions, 7094 events. 816/7094 cut-off events. For 982/1020 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 69960 event pairs, 215 based on Foata normal form. 10/6551 useless extension candidates. Maximal degree in co-relation 6320. Up to 685 conditions per place. [2024-11-16 23:11:54,115 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 16 selfloop transitions, 6 changer transitions 0/269 dead transitions. [2024-11-16 23:11:54,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 269 transitions, 936 flow [2024-11-16 23:11:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:11:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:11:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2024-11-16 23:11:54,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9270833333333334 [2024-11-16 23:11:54,119 INFO L175 Difference]: Start difference. First operand has 234 places, 262 transitions, 872 flow. Second operand 3 states and 623 transitions. [2024-11-16 23:11:54,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 269 transitions, 936 flow [2024-11-16 23:11:54,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 269 transitions, 914 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:11:54,133 INFO L231 Difference]: Finished difference. Result has 236 places, 266 transitions, 896 flow [2024-11-16 23:11:54,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=236, PETRI_TRANSITIONS=266} [2024-11-16 23:11:54,134 INFO L277 CegarLoopForPetriNet]: 212 programPoint places, 24 predicate places. [2024-11-16 23:11:54,134 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 266 transitions, 896 flow [2024-11-16 23:11:54,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:54,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:54,135 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] [2024-11-16 23:11:54,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:11:54,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-16 23:11:54,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1668297336, now seen corresponding path program 1 times [2024-11-16 23:11:54,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:54,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158666511] [2024-11-16 23:11:54,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:54,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:11:54,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:54,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158666511] [2024-11-16 23:11:54,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158666511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:11:54,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:11:54,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:11:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513098100] [2024-11-16 23:11:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:11:54,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:11:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:54,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:11:54,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:11:54,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 224 [2024-11-16 23:11:54,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 266 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:54,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:54,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 224 [2024-11-16 23:11:54,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:54,483 INFO L124 PetriNetUnfolderBase]: 64/1325 cut-off events. [2024-11-16 23:11:54,484 INFO L125 PetriNetUnfolderBase]: For 171/173 co-relation queries the response was YES. [2024-11-16 23:11:54,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 1325 events. 64/1325 cut-off events. For 171/173 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7109 event pairs, 9 based on Foata normal form. 24/1279 useless extension candidates. Maximal degree in co-relation 1803. Up to 86 conditions per place. [2024-11-16 23:11:54,490 INFO L140 encePairwiseOnDemand]: 220/224 looper letters, 7 selfloop transitions, 4 changer transitions 0/208 dead transitions. [2024-11-16 23:11:54,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 208 transitions, 615 flow [2024-11-16 23:11:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:11:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:11:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2024-11-16 23:11:54,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345238095238095 [2024-11-16 23:11:54,495 INFO L175 Difference]: Start difference. First operand has 236 places, 266 transitions, 896 flow. Second operand 3 states and 628 transitions. [2024-11-16 23:11:54,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 208 transitions, 615 flow [2024-11-16 23:11:54,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 208 transitions, 525 flow, removed 27 selfloop flow, removed 17 redundant places. [2024-11-16 23:11:54,501 INFO L231 Difference]: Finished difference. Result has 210 places, 206 transitions, 504 flow [2024-11-16 23:11:54,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=210, PETRI_TRANSITIONS=206} [2024-11-16 23:11:54,502 INFO L277 CegarLoopForPetriNet]: 212 programPoint places, -2 predicate places. [2024-11-16 23:11:54,503 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 206 transitions, 504 flow [2024-11-16 23:11:54,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:54,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:54,506 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] [2024-11-16 23:11:54,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:11:54,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-16 23:11:54,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:54,507 INFO L85 PathProgramCache]: Analyzing trace with hash 445059134, now seen corresponding path program 1 times [2024-11-16 23:11:54,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:54,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519339556] [2024-11-16 23:11:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:54,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:11:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:54,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519339556] [2024-11-16 23:11:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519339556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:11:54,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:11:54,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:11:54,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135360580] [2024-11-16 23:11:54,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:11:54,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:11:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:54,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:11:54,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:11:54,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 224 [2024-11-16 23:11:54,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 206 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:54,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:54,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 224 [2024-11-16 23:11:54,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:54,739 INFO L124 PetriNetUnfolderBase]: 78/1271 cut-off events. [2024-11-16 23:11:54,739 INFO L125 PetriNetUnfolderBase]: For 144/146 co-relation queries the response was YES. [2024-11-16 23:11:54,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1271 events. 78/1271 cut-off events. For 144/146 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6912 event pairs, 38 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 1050. Up to 171 conditions per place. [2024-11-16 23:11:54,744 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 21 selfloop transitions, 2 changer transitions 5/206 dead transitions. [2024-11-16 23:11:54,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 551 flow [2024-11-16 23:11:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:11:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:11:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 601 transitions. [2024-11-16 23:11:54,747 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8943452380952381 [2024-11-16 23:11:54,747 INFO L175 Difference]: Start difference. First operand has 210 places, 206 transitions, 504 flow. Second operand 3 states and 601 transitions. [2024-11-16 23:11:54,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 551 flow [2024-11-16 23:11:54,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:11:54,751 INFO L231 Difference]: Finished difference. Result has 210 places, 200 transitions, 492 flow [2024-11-16 23:11:54,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=210, PETRI_TRANSITIONS=200} [2024-11-16 23:11:54,753 INFO L277 CegarLoopForPetriNet]: 212 programPoint places, -2 predicate places. [2024-11-16 23:11:54,753 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 200 transitions, 492 flow [2024-11-16 23:11:54,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:54,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:54,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:11:54,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:11:54,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2024-11-16 23:11:54,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash 920046213, now seen corresponding path program 1 times [2024-11-16 23:11:54,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:54,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325515070] [2024-11-16 23:11:54,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:11:55,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325515070] [2024-11-16 23:11:55,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325515070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:11:55,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:11:55,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:11:55,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308062943] [2024-11-16 23:11:55,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:11:55,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:11:55,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:55,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:11:55,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:11:55,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 224 [2024-11-16 23:11:55,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 200 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:55,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:55,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 224 [2024-11-16 23:11:55,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:55,599 INFO L124 PetriNetUnfolderBase]: 92/1278 cut-off events. [2024-11-16 23:11:55,599 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-11-16 23:11:55,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1278 events. 92/1278 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7079 event pairs, 47 based on Foata normal form. 0/1235 useless extension candidates. Maximal degree in co-relation 1608. Up to 190 conditions per place. [2024-11-16 23:11:55,604 INFO L140 encePairwiseOnDemand]: 218/224 looper letters, 0 selfloop transitions, 0 changer transitions 203/203 dead transitions. [2024-11-16 23:11:55,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 203 transitions, 552 flow [2024-11-16 23:11:55,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:11:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:11:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1178 transitions. [2024-11-16 23:11:55,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8764880952380952 [2024-11-16 23:11:55,609 INFO L175 Difference]: Start difference. First operand has 210 places, 200 transitions, 492 flow. Second operand 6 states and 1178 transitions. [2024-11-16 23:11:55,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 203 transitions, 552 flow [2024-11-16 23:11:55,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:11:55,613 INFO L231 Difference]: Finished difference. Result has 207 places, 0 transitions, 0 flow [2024-11-16 23:11:55,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=207, PETRI_TRANSITIONS=0} [2024-11-16 23:11:55,614 INFO L277 CegarLoopForPetriNet]: 212 programPoint places, -5 predicate places. [2024-11-16 23:11:55,614 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 0 transitions, 0 flow [2024-11-16 23:11:55,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:11:55,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2024-11-16 23:11:55,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 26 remaining) [2024-11-16 23:11:55,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2024-11-16 23:11:55,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2024-11-16 23:11:55,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2024-11-16 23:11:55,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2024-11-16 23:11:55,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2024-11-16 23:11:55,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2024-11-16 23:11:55,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2024-11-16 23:11:55,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2024-11-16 23:11:55,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2024-11-16 23:11:55,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2024-11-16 23:11:55,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2024-11-16 23:11:55,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2024-11-16 23:11:55,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2024-11-16 23:11:55,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2024-11-16 23:11:55,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2024-11-16 23:11:55,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2024-11-16 23:11:55,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2024-11-16 23:11:55,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2024-11-16 23:11:55,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2024-11-16 23:11:55,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2024-11-16 23:11:55,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2024-11-16 23:11:55,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2024-11-16 23:11:55,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2024-11-16 23:11:55,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2024-11-16 23:11:55,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:11:55,625 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:11:55,630 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 23:11:55,630 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:11:55,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:11:55 BasicIcfg [2024-11-16 23:11:55,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:11:55,637 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:11:55,637 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:11:55,638 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:11:55,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:11:46" (3/4) ... [2024-11-16 23:11:55,640 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 23:11:55,643 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2024-11-16 23:11:55,643 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2024-11-16 23:11:55,646 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-16 23:11:55,646 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 23:11:55,646 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 23:11:55,646 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 23:11:55,735 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:11:55,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 23:11:55,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:11:55,736 INFO L158 Benchmark]: Toolchain (without parser) took 10087.71ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 841.0MB). Free memory was 128.9MB in the beginning and 448.7MB in the end (delta: -319.8MB). Peak memory consumption was 522.6MB. Max. memory is 16.1GB. [2024-11-16 23:11:55,736 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 161.5MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:11:55,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.66ms. Allocated memory is still 161.5MB. Free memory was 128.5MB in the beginning and 95.8MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 23:11:55,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.78ms. Allocated memory is still 161.5MB. Free memory was 95.8MB in the beginning and 92.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 23:11:55,737 INFO L158 Benchmark]: Boogie Preprocessor took 48.22ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:11:55,737 INFO L158 Benchmark]: IcfgBuilder took 587.24ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 90.7MB in the beginning and 154.0MB in the end (delta: -63.2MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-11-16 23:11:55,738 INFO L158 Benchmark]: TraceAbstraction took 8705.71ms. Allocated memory was 197.1MB in the beginning and 1.0GB in the end (delta: 805.3MB). Free memory was 153.0MB in the beginning and 452.9MB in the end (delta: -299.9MB). Peak memory consumption was 506.2MB. Max. memory is 16.1GB. [2024-11-16 23:11:55,738 INFO L158 Benchmark]: Witness Printer took 98.40ms. Allocated memory is still 1.0GB. Free memory was 452.9MB in the beginning and 448.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 23:11:55,743 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 161.5MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.66ms. Allocated memory is still 161.5MB. Free memory was 128.5MB in the beginning and 95.8MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.78ms. Allocated memory is still 161.5MB. Free memory was 95.8MB in the beginning and 92.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.22ms. Allocated memory is still 161.5MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 587.24ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 90.7MB in the beginning and 154.0MB in the end (delta: -63.2MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8705.71ms. Allocated memory was 197.1MB in the beginning and 1.0GB in the end (delta: 805.3MB). Free memory was 153.0MB in the beginning and 452.9MB in the end (delta: -299.9MB). Peak memory consumption was 506.2MB. Max. memory is 16.1GB. * Witness Printer took 98.40ms. Allocated memory is still 1.0GB. Free memory was 452.9MB in the beginning and 448.7MB 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: 962]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 999]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 969]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1010]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 950]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 950]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 984]: 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, 382 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.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 30 mSDtfsCounter, 591 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=896occurred 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.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 1281 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-11-16 23:11:55,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE